We present two new algorithms for solving the All Pairs Shortest Paths (APSP) problem for weighted directed graphs. Both algorithms use fast matrix multiplication algorithms. The first algorithm solves the APSP problem for weighted directed graphs in which the edge weights are integers of small absolute value in
|
2004
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
658
|
A Note on Two Problems in Connexion with Graphs. Numerische Mathematik
– Dijkstra
- 1959
|
|
508
|
Matrix multiplication viaarithmetic progressions
– Coppersmith, Winograd
- 1982
|
|
410
|
Fibonacci heaps and their uses in improved network optimization algorithms
– Fredman, Tarjan
- 1987
|
|
231
|
A greedy heuristic for the set-covering problem
– Chvatal
- 1979
|
|
185
|
On the ratio of optimal integral and fractional covers
– Lovász
- 1975
|
|
92
|
Efficient algorithms for shortest paths in sparse networks
– Johnson
- 1977
|
|
59
|
Schnelle Multiplikation grosser Zahlen
– Schonhage, Strassen
- 1971
|
|
55
|
On the exponent of the all pairs shortest path problem
– Alon, Galil, et al.
- 1997
|
|
50
|
Fast rectangular matrix multiplication and applications
– Huang, Pan
- 1998
|
|
47
|
Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica
– Alon, Naor
|
|
47
|
All pairs almost shortest paths
– Dor, Halperin, et al.
- 1997
|
|
47
|
New bounds on the complexity of the shortest path problem
– Fredman
- 1976
|
|
47
|
Finding the hidden path: time bounds for all-pairs shortest paths
– Karger, Koller, et al.
- 1995
|
|
40
|
Fast estimation of diameter and shortest paths (without matrix multiplication
– Aingworth, Chekuri, et al.
|
|
37
|
Rectangular Matrix Multiplication Revisited, Research Report 20498
– Coppersmith
- 1996
|
|
37
|
A New Upper Bound on the complexity of the all pairs shortest path problem
– Takaoka
- 1992
|
|
34
|
On the all-pairs-shortest-path problem in unweighted undirected graphs
– Seidel
- 1995
|
|
24
|
All-pairs small-stretch paths
– Cohen, Zwick
|
|
22
|
All pairs shortest paths for graphs with small integer length edges
– Galil, Margalit
- 1997
|
|
18
|
Subcubic cost algorithms for the all pairs shortest path problem
– Takaoka
- 1998
|
|
14
|
All-pairs shortest paths and the essential subgraph
– McGeoch
- 1995
|
|
13
|
All pairs shortest distances for graphs with small integer length edges
– Galil, Margalit
- 1997
|
|
12
|
An Algorithm for Finding All Shortest Paths Using N 2.81 Infinite-Precision Multiplications
– Yuval
- 1976
|
|
5
|
Witnesses for boolean matrix multiplication
– Galil, Margalit
- 1993
|
|
