Optimal distributed algorithm for minimum spanning trees revisited

DOI10.1145/224964.225474zbMath1373.68447OpenAlexW2053783303MaRDI QIDQ5361459

Michalis Faloutsos, Mart L. Molle

Publication date: 29 September 2017

Published in: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/224964.225474

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (8)

Local heuristics and the emergence of spanning subgraphs in complex networks ⋮ Optimal cost-sensitive distributed minimum spanning tree algorithm ⋮ A linear-time optimal-message distributed algorithm for minimum spanning trees ⋮ Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model ⋮ Unnamed Item ⋮ On Verifying Fault Tolerance of Distributed Protocols ⋮ Distributed MST for constant diameter graphs ⋮ Simple and efficient network decomposition and synchronization

This page was built for publication: Optimal distributed algorithm for minimum spanning trees revisited