A linear-time optimal-message distributed algorithm for minimum spanning trees

DOI10.1007/S00446-004-0107-2zbMath1448.68469OpenAlexW2000695296MaRDI QIDQ5138511

Michalis Faloutsos, Mart L. Molle

Publication date: 4 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-004-0107-2

zbMATH Keywords

time complexityminimum spanning treeoptimal time

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (1)

Unnamed Item

Cites Work

• A Distributed Algorithm for Minimum-Weight Spanning Trees
• A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
• Optimal distributed algorithm for minimum spanning trees revisited
• Fast distributed construction of k-dominating sets and applications

This page was built for publication: A linear-time optimal-message distributed algorithm for minimum spanning trees