24 citations · 85 across the 17 of their papers we have counts for
4 papers · 1 filter
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…
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…
Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths
Matteo Pontecorvi, Vijaya Ramachandran
The betweenness centrality (BC) of a node in a network (or graph) is a measure of its importance in the network. BC is widely used in a large number of environments such as social…
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…