Improved algorithm for all pairs shortest paths
- 15 September 2004
- journal article
- research article
- Published by Elsevier BV in Information Processing Letters
- Vol. 91 (5), 245-250
- https://doi.org/10.1016/j.ipl.2004.05.006
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- All Pairs Shortest Distances for Graphs with Small Integer Length EdgesInformation and Computation, 1997
- On the All-Pairs-Shortest-Path Problem in Unweighted Undirected GraphsJournal of Computer and System Sciences, 1995
- A new upper bound on the complexity of the all pairs shortest path problemInformation Processing Letters, 1992
- A more efficient algorithm for the min-plus multiplicationInternational Journal of Computer Mathematics, 1990
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- New Bounds on the Complexity of the Shortest Path ProblemSIAM Journal on Computing, 1976