Distributed MST for constant diameter graphs
From MaRDI portal
Publication:5890494
DOI10.1145/383962.383984zbMath1333.05294OpenAlexW2084206787MaRDI QIDQ5890494
Boaz Patt-Shamir, Zvi Lotker, David Peleg
Publication date: 4 March 2016
Published in: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/383962.383984
Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)
Related Items
Tight bounds for distributed minimum-weight spanning tree verification ⋮ Hundreds of impossibility results for distributed computing ⋮ Fast deterministic distributed algorithms for sparse spanners ⋮ Sparsifying Congested Cliques and Core-Periphery Networks ⋮ Unnamed Item