Arboricity and spanning-tree packing in random graphs with an application to load balancing
From MaRDI portal
Publication:5383982
DOI10.1137/1.9781611973402.23zbMath1423.05154arXiv1303.3881OpenAlexW2952208722WikidataQ57991437 ScholiaQ57991437MaRDI QIDQ5383982
Pu Gao, Xavier Pérez-Giménez, Cristiane M. Sato
Publication date: 20 June 2019
Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.3881
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (5)
Distributed algorithms for random graphs ⋮ Packing arborescences in random digraphs ⋮ Optimal path and cycle decompositions of dense quasirandom graphs ⋮ On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph ⋮ Density decompositions of networks
This page was built for publication: Arboricity and spanning-tree packing in random graphs with an application to load balancing
