Brief Announcement: Faster Asynchronous MST and Low Diameter Tree Construction with Sublinear Communication

Authors Ali Mashreghi, Valerie King

Thumbnail PDF


  • Filesize: 317 kB
  • 3 pages

Document Identifiers

Author Details

Ali Mashreghi
  • Department of Computer Science, University of Victoria, BC, Canada
Valerie King
  • Department of Computer Science, University of Victoria, BC, Canada

Cite AsGet BibTex

Ali Mashreghi and Valerie King. Brief Announcement: Faster Asynchronous MST and Low Diameter Tree Construction with Sublinear Communication. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 49:1-49:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)


Building a spanning tree, minimum spanning tree (MST), and BFS tree in a distributed network are fundamental problems which are still not fully understood in terms of time and communication cost. The first work to succeed in computing a spanning tree with communication sublinear in the number of edges in an asynchronous CONGEST network appeared in DISC 2018. That algorithm which constructs an MST is sequential in the worst case; its running time is proportional to the total number of messages sent. Our paper matches its message complexity but brings the running time down to linear in n. Our techniques can also be used to provide an asynchronous algorithm with sublinear communication to construct a tree in which the distance from a source to each node is within an additive term of sqrt{n} of its actual distance.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed computing models
  • Distributed Computing
  • Minimum Spanning Tree
  • Broadcast Tree


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Baruch Awerbuch. Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems. In STOC, pages 230-240, 1987. Google Scholar
  2. Baruch Awerbuch, Oded Goldreich, Ronen Vainish, and David Peleg. A trade-off between information and communication in broadcast protocols. Journal of the ACM, 37(2):238-256, 1990. Google Scholar
  3. R.G. Gallager. Distributed minimum hop algorithms. Technical Report LIDS-P-1175, MIT Laboratory for Information and Decision Systems, 1982. Google Scholar
  4. Mohsen Ghaffari and Fabian Kuhn. Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping. In DISC, pages 30:1-30:12, 2018. Google Scholar
  5. Valerie King, Shay Kutten, and Mikkel Thorup. Construction and impromptu repair of an MST in a distributed network with o(m) communication. In PODC, pages 71-80, 2015. Google Scholar
  6. Ali Mashreghi and Valerie King. Broadcast and Minimum Spanning Tree with o(m) Messages in the Asynchronous CONGEST Model. In DISC, volume 121, pages 37:1-37:17, 2018. Google Scholar
  7. Ali Mashreghi and Valerie King. Faster asynchronous MST and low diameter tree construction with sublinear communication. arXiv e-prints, July 2019. URL:
  8. David Peleg. Distributed computing. SIAM Monographs on discrete mathematics and applications, 5, 2000. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail