16 citations · 27 across the 11 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DS2018★ 4 cited
New and Simplified Distributed Algorithms for Weighted All Pairs Shortest Paths
Udit Agarwal, Vijaya Ramachandran
We consider the problem of computing all pairs shortest paths (APSP) and shortest paths for k sources in a weighted graph in the distributed CONGEST model. For graphs with non-nega…
cs.DS2018★ 2 cited
A Deterministic Distributed Algorithm for Weighted All Pairs Shortest Paths Through Pipelining
Udit Agarwal, Vijaya Ramachandran
We present a new pipelined approach to compute all pairs shortest paths (APSP) in a directed graph with nonnegative integer edge weights (including zero weights) in the CONGEST mod…
cs.DS2018★ 1 cited
A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Rounds
Udit Agarwal, Vijaya Ramachandran, Valerie King +1
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…