Packing spanning trees and the $k$-tree protocol
Robert F. Bailey, Brett Stevens
TL;DR
This paper characterizes maximum spanning tree-packable graphs, which are crucial for the k-tree protocol, by providing structural descriptions and invariants that determine when a graph can support the maximum number of edge-disjoint spanning trees.
Contribution
It offers a new structural characterization and invariants for maximum spanning tree-packable graphs, advancing understanding of their properties and applications in network protocols.
Findings
Identifies structural properties of maximum spanning tree-packable graphs
Provides invariants that characterize these graphs
Enhances understanding of the k-tree protocol's graph requirements
Abstract
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].
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · VLSI and FPGA Design Techniques · Advanced Graph Theory Research