215 citations · 318 across the 83 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017★ 2 cited
Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time
Danupon Nanongkai, Thatchaphol Saranurak, Christian Wulff-Nilsen
We present a Las Vegas algorithm for dynamically maintaining a minimum spanning forest of an -node graph undergoing edge insertions and deletions. Our algorithm guarantees an $O…
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…