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

DOI10.1145/3055399.3055449MaRDI QIDQ6829660zbMATH OpenFDO

Authors Gopal Pandurangan, Peter Robinson, Michele Scquizzato

Publication date 17 August 2017

Published in Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11577/3317205

zbMATH Keywords

distributed algorithmsminimum spanning trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

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

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