A note on packing spanning trees in graphs and bases in matroids

zbMath1296.05103arXiv1203.1014MaRDI QIDQ2876023

Robert F. Bailey, Brett Stevens, Michael W. Newman

Publication date: 15 August 2014

Full work available at URL: https://arxiv.org/abs/1203.1014

zbMATH Keywords

edge-disjoint spanning treescommunication protocols

Mathematics Subject Classification ID

Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Related Items (1)

Clustering analysis of a dissimilarity: a review of algebraic and geometric representation

This page was built for publication: A note on packing spanning trees in graphs and bases in matroids