arXiv (All)open access
Beating Quadratic Time--Message Trade-off in Distributed Minimum Spanning Tree Construction
data structures and algorithms, distributed, parallel, and cluster computing
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 799512
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.