Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Volume abs/1811.03337, 2019, Pages 334-342.

Cited by: 13|Bibtex|Views19|Links
EI
Keywords:
CONGEST all-pairs shortest paths distributed computing graph algorithms

Abstract:

In the distributed all-pairs shortest paths problem (APSP), every node in the weighted undirected distributed network (the CONGEST model) needs to know the distance from every other node using least number of communication rounds (typically called time complexity). The problem admits (1+o(1))-approximation Θ(n)-time algorithm and a nearly...More

Code:

Data:

Your rating :
0

 

Tags
Comments