Packing spanning trees and the k-tree protocol

MaRDI QIDQ6222342zbMATH OpenFDO

Authors Robert F. Bailey, Brett Stevens

Publication date 11 December 2010

Mathematics Subject Classification ID

Trees (05C05) Network design and communication in computer systems (68M10) Reliability, availability, maintenance, inspection in operations research (90B25)

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].

This page was built for publication: Packing spanning trees and the $k$-tree protocol

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6222342)