On packing low-diameter spanning trees

DOI10.4230/LIPICS.ICALP.2020.33MaRDI QIDQ6842543zbMATH OpenFDO

Authors Julia Chuzhoy, M. Parter, Zihan Tan

Publication date 18 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2020.33

zbMATH Keywords

edge-connectivitypackingspanning tree

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• A new perspective on vertex connectivity
• A short proof of the tree-packing theorem
• Almost-Tight Distributed Minimum Cut Algorithms
• Distributed algorithms for planar networks. II: Low-congestion shortcuts, MST, and Min-Cut
• Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs
• Distributed Broadcast Revisited: Towards Universal Optimality
• Distributed Computing: A Locality-Sensitive Approach
• Distributed connectivity decomposition
• Distributed edge connectivity in sublinear time
• Distributed minimum cut approximation
• Distributed MST for constant diameter graphs
• Distributed verification and hardness of distributed approximation
• Edge-Disjoint Spanning Trees of Finite Graphs
• Fast computation of small cuts via cycle space sampling
• Low congestion cycle covers and their applications
• Low-congestion shortcut and graph parameters
• On the Problem of Decomposing a Graph into n Connected Factors
• Random sampling in cut, flow, and network design problems
• The multi-tree approach to reliability in distributed networks
• Tight bounds on vertex connectivity under vertex sampling

This page was built for publication: On packing low-diameter spanning trees

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