Sciweavers

78
Voted
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
14 years 3 months ago
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
Timothy M. Chan