A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in $\tilde{O}(n^{3/2})$ Rounds
Data Structures and Algorithms
2018-04-17 v1 Distributed, Parallel, and Cluster Computing
Abstract
We present a deterministic distributed algorithm to compute all-pairs shortest paths(APSP) in an edge-weighted directed or undirected graph. Our algorithm runs in rounds in the Congest model, where is the number of nodes in the graph. This is the first rounds deterministic distributed algorithm for the weighted APSP problem. Our algorithm is fairly simple and incorporates a deterministic distributed algorithm we develop for computing a `blocker set' \cite{King99}, which has been used earlier in sequential dynamic computation of APSP.
Cite
@article{arxiv.1804.05441,
title = {A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in $\tilde{O}(n^{3/2})$ Rounds},
author = {Udit Agarwal and Vijaya Ramachandran and Valerie King and Matteo Pontecorvi},
journal= {arXiv preprint arXiv:1804.05441},
year = {2018}
}