Distributed Minimum Degree Spanning Trees

DOI10.1145/3293611.3331604MaRDI QIDQ5145263OpenAlexWikidataFDO

Authors Michael Dinitz, Magnús M. Halldórsson, Taisuke Izumi, Calvin Newport

Publication date 20 January 2021

Published in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

minimum degreespanning treecongest

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS
• Self-stabilizing minimum degree spanning tree within one from the optimal degree
• A Fast Distributed Approximation Algorithm for Minimum Spanning Trees

Cited in

(2)

• A distributed algorithm for directed minimum-weight spanning tree
• Distributed Relationship Schemes for Trees

This page was built for publication: Distributed Minimum Degree Spanning Trees

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