Abstract
We show that the All Pairs Shortest Paths (APSP) problem for undirected graphs with integer edge weights taken from the range {1, 2, ..., M} can be solved using only a logarithmic number of distance products of matrices with elements in the range {1, 2,..., M}. As a result, we get an algorithm for the APSP problem in such graphs that runs in Ō(Mn$+ω/) time, where n is the number of vertices in the algorithm of Galil and Margalit.
| Original language | English |
|---|---|
| Pages (from-to) | 605-614 |
| Number of pages | 10 |
| Journal | Annual Symposium on Foundations of Computer Science - Proceedings |
| State | Published - 1999 |
| Event | Proceedings of the 1999 IEEE 40th Annual Conference on Foundations of Computer Science - New York, NY, USA Duration: 17 Oct 1999 → 19 Oct 1999 |