215 citations · 689 across the 60 of their papers we have counts for
Showing 2017 · cs.DCShow all
2 papers · 2 filters
cs.DC2017★ 27 cited
A Faster Distributed Single-Source Shortest Paths Algorithm
Sebastian Forster, Danupon Nanongkai
We devise new algorithms for the single-source shortest paths (SSSP) problem with non-negative edge weights in the CONGEST model of distributed computing. While close-to-optimal so…
cs.DC2017★ 4 cited
Distributed Exact Weighted All-Pairs Shortest Paths in Rounds
Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak
We study computing {\em all-pairs shortest paths} (APSP) on distributed networks (the CONGEST model). The goal is for every node in the (weighted) network to know the distance from…