arXiv (OAI Expanded)
open access
Beating Quadratic Time--Message Trade-off in Distributed Minimum Spanning Tree Construction
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: f
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Beating Quadratic Time--Message Trade-off in Distributed Minimum Spanning Tree Construction#799512
- An $m+n^{3/2}$ algorithm for counting spanning trees by $\ell_1$-regularized resistance#1084366
- Polynomial positivity cones for Coxeter roots and walks in trees#998859
- Models of random spanning trees#176992
- On Capacity and Delay of Wireless Networks with Node Failures#178837
Record · ID 798089
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive