Round- and Message-Optimal Distributed Graph Algorithms

DOI10.1145/3212734.3212737zbMath1428.68381arXiv1801.05127OpenAlexW2793058913MaRDI QIDQ5197673

D. Ellis Hershkowitz, David Wajc, Bernhard Haeupler

Publication date: 19 September 2019

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

Full work available at URL: https://arxiv.org/abs/1801.05127

zbMATH Keywords

distributed graph algorithmsCongestlow-congestion shortcutspart-wise aggregation

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (6)

Latency, capacity, and distributed minimum spanning trees ⋮ Low-congestion shortcuts without embedding ⋮ A novel pseudo‐polynomial approach for shortest path problems ⋮ Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications ⋮ Low-congestion shortcut and graph parameters ⋮ Unnamed Item

This page was built for publication: Round- and Message-Optimal Distributed Graph Algorithms