A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds
From MaRDI portal
Publication:5197684
DOI10.1145/3212734.3212773zbMath1428.68363arXiv1804.05441OpenAlexW2963245981MaRDI QIDQ5197684
Udit Agarwal, Matteo Pontecorvi, Valerie King, Vijaya Ramachandran
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/1804.05441
Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)
Related Items (6)
Single-source shortest paths in the CONGEST model with improved bounds ⋮ The sparsest additive spanner via multiple weighted BFS trees ⋮ Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles ⋮ The Sparsest Additive Spanner via Multiple Weighted BFS Trees ⋮ Fast approximate shortest paths in the congested clique ⋮ Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time
This page was built for publication: A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds
