126 search results - page 1 / 26 » More Algorithms for All-Pairs Shortest Paths in Weighted Gra... |
SIAMCOMP
2010
12 years 11 months ago
2010
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...
ALGORITHMICA
2011
12 years 11 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
IPPS
1998
IEEE
13 years 8 months ago
1998
IEEE
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
STOC
2003
ACM
14 years 4 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
PPSN
2010
Springer
13 years 2 months ago
2010
Springer
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...