# A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in tildeO(n3/2) Rounds

arXiv: https://arxiv.org/abs/1804.05441 · HTML: https://mlsanity.com/paper/1804.05441/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 15 Apr 2018.

## Built on by (most cited first, 1 of 1)

- [Optimizing Graph Transformer Networks with Graph-based Techniques](https://mlsanity.com/paper/2106.08500/) (2021)

## Abstract (arXiv)

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 tildeO(n3/2) rounds in the Congest model, where n is the number of nodes in the graph. This is the first o(n2) 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' citeKing99, which has been used earlier in sequential dynamic computation of APSP.