Metraipolis › archive › dc_d66be8a1cb5c
Beating Quadratic Time--Message Trade-off in Distributed Minimum Spanning Tree Construction — arXiv:2608.30299
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.30299
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T08:19:04.406Z
- SHA-256 of the archived text
3b14f218875dbbdb44c2d48792f3efe981fd0ded7e08b2f63de17ba766c68d90- Stable URL of this page
https://metraipolis.com/documento/dc_d66be8a1cb5c
How to cite
Beating Quadratic Time--Message Trade-off in Distributed Minimum Spanning Tree Construction — arXiv:2608.30299 — arXiv (en), https://arxiv.org/abs/2608.30299 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d66be8a1cb5c (Metraipolis archive dc_d66be8a1cb5c, sha256 3b14f218875dbbdb44c2d48792f3efe981fd0ded7e08b2f63de17ba766c68d90)
BibTeX
@misc{dcd66be8a1cb5c,
title = {Beating Quadratic Time--Message Trade-off in Distributed Minimum Spanning Tree Construction — arXiv:2608.30299},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.30299},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d66be8a1cb5c; sha256 3b14f218875dbbdb44c2d48792f3efe981fd0ded7e08b2f63de17ba766c68d90},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.30299. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We present a new distributed algorithm for computing a minimum spanning tree (MST) in the \textsf{CONGEST-KT$_{1}$} model, where messages are limited to $O(\log n)$ bits and each vertex initially knows the identifiers of its neighbors. Our algorithm exposes a two-parameter time--message trade-off: for any $0 \leq \lambda \leq \kappa \leq 1/2$, it runs in $\tilde{O}(n^{\lambda}D_G + n^{1 - \kappa - \lambda} + n^{1 - 2\kappa + \lambda} + n^{1/2})$ rounds and uses $\tilde{O}(\min\{m, n^{1 + \kappa}\})$ messages, where $n$, $m$, and $D_G$ are the number of vertices, edges, and thenetwork diameter, respectively. In particular, setting $(\kappa, \lambda) = (1/3, 1/6)$ yields an MST algorithm running in $\tilde{O}(n^{1/2} + n^{1/6}D_G)$ rounds with only $\tilde{O}(n^{4/3})$ messages. Under the mild assumption $D_G = O(n^{1/3})$, this is round-optimal while improving the best known message bound of $\tilde{O}(n^{3/2})$. More broadly, our algorithm breaks the quadratic time--message trade-off barrier $\mathrm{\# rounds} \cdot \mathrm{\# messages} = \tilde{\Omega}(n^2)$, which no previous MST algorithm in the \textsf{CONGEST-KT$_{1}$} model has been able to overcome, and it does so for almost the entire range of the diameter $D_G$. As a byproduct, we also obtain new low-message broadcast, spanning-tree, and leader-election algorithms.
Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-01 in cs.DC).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2608.30299 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T08:07:11.124Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).