Abstract
The all pairs shortest paths (APSP) problem is one of the most fundamental algorithmic graph problems. The complexity of the fastest known algorithm for solving the problem for weighted directed graphs, without negative cycles, is O(mn+n2 log n), where n and m are the number of vertices and edges in the graph. An all pairs almost shortest paths (APASP) time algorithm has been developed for computing all distances in the unweighted undirected graph on n vertices. The algorithm is simple, easy to implement, and faster than the fastest known matrix multiplication algorithm.
| Original language | English |
|---|---|
| Pages (from-to) | 452-461 |
| Number of pages | 10 |
| Journal | Annual Symposium on Foundations of Computer Science - Proceedings |
| State | Published - 1996 |
| Event | Proceedings of the 1996 37th Annual Symposium on Foundations of Computer Science - Burlington, VT, USA Duration: 14 Oct 1996 → 16 Oct 1996 |