Packing spanning trees and the $k$-tree protocol

Details Packing spanning trees and the $k$-tree protocol Packing spanning trees and the $k$-tree protocol

2010-12-11

arxiv.org/abs/1012.2478v2

Mathematics

Combinatorics

This paper has been superseded by arXiv:1203.1014 "On packing spanning trees in graphs and bases in matroids" by Robert F. Bai

Scientific paper

We provide a structural description of, and invariants for, maximum spanning
tree-packable graphs, i.e. those graphs G for which the edge connectivity of G
is equal to the maximum number of edge-disjoint spanning trees in G. These
graphs are of interest for the k-tree protocol of Itai and Rodeh [Inform. and
Comput. 79 (1988), 43-59].

Affiliated with

Also associated with

No associations

Rating

Packing spanning trees and the $k$-tree protocol does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Packing spanning trees and the $k$-tree protocol, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Packing spanning trees and the $k$-tree protocol will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-105799