A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in $\tilde{O}(n^{3/2})$ Rounds

Matteo Pontecorvi; Udit Agarwal; Valerie King; Vijaya Ramachandran

REVIEW

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1804.05441 v1 pith:FP2N77UB submitted 2018-04-15 cs.DS cs.DC

A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in tilde{O}(n^(3/2)) Rounds

Udit Agarwal , Vijaya Ramachandran , Valerie King , Matteo Pontecorvi This is my paper

classification cs.DS cs.DC

keywords algorithmdeterministicdistributedapsproundsall-pairsgraphpaths

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original 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 $\tilde{O}(n^{3/2})$ rounds in the Congest model, where $n$ is the number of nodes in the graph. This is the first $o(n^2)$ 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.

A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in tilde{O}(n^(3/2)) Rounds

discussion (0)