A simple deterministic distributed MST algorithm with near-optimal time and message complexities

DOI10.1145/3380546MaRDI QIDQ6829743zbMATH OpenFDO

Authors Michael Elkin

Publication date 11 November 2020

Published in Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

distributed graph algorithmsminimum spanning tree

Mathematics Subject Classification ID

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

Cited in

(2)

• The message complexity of distributed graph optimization
• Tight bounds on the message complexity of distributed tree verification

This page was built for publication: A simple deterministic distributed MST algorithm with near-optimal time and message complexities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6829743)