On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem
DOI:
https://doi.org/10.7155/jgaa.00410Keywords:
Shoshan-Zwick algorithm , all-pairs shortest path , certification , matrix multiplicationAbstract
The Shoshan-Zwick algorithm solves the all-pairs shortest paths problem in undirected graphs with integer edge costs in the range $\{1, 2, \dots, M\}$. It runs in $\tilde{O}(M\cdot n^{\omega})$ time, where $n$ is the number of vertices, $M$ is the largest integer edge cost, and $\omega < 2.3727$ is the exponent of matrix multiplication. It is the fastest known algorithm for this problem. This paper points out and corrects an error in the Shoshan-Zwick algorithm.Downloads
Download data is not yet available.
Downloads
Published
2017-01-01
How to Cite
Eirinakis, P., Williamson, M., & Subramani, K. (2017). On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem. Journal of Graph Algorithms and Applications, 21(2), 177–181. https://doi.org/10.7155/jgaa.00410
License
Copyright (c) 2017 Pavlos Eirinakis, Matthew Williamson, K. Subramani
This work is licensed under a Creative Commons Attribution 4.0 International License.