Distributed MST and Routing in Almost Mixing Time

DOI10.1145/3087801.3087827zbMath1380.68425OpenAlexW2737872496WikidataQ130877438 ScholiaQ130877438MaRDI QIDQ5368953

Fabian Kuhn, Hsin-Hao Su, Mohsen Ghaffari

Publication date: 11 October 2017

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

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

zbMATH Keywords

minimum spanning treeroutingdistributed graph algorithmscongest model

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (7)

Sublinear-time distributed algorithms for detecting small cliques and even cycles ⋮ Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications ⋮ A Near-Optimal Deterministic Distributed Synchronizer ⋮ Low-congestion shortcut and graph parameters ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fast distributed algorithms for testing graph properties

This page was built for publication: Distributed MST and Routing in Almost Mixing Time