Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
- 1 December 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 22 (6) , 1199-1217
- https://doi.org/10.1137/0222071
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Planar graph decomposition and all pairs shortest pathsJournal of the ACM, 1991
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Faster Scaling Algorithms for Network ProblemsSIAM Journal on Computing, 1989
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- The shortest-path problem for graphs with random arc-lengthsDiscrete Applied Mathematics, 1985
- Minimum Paths in Directed GraphsJournal of the Operational Research Society, 1977
- New Bounds on the Complexity of the Shortest Path ProblemSIAM Journal on Computing, 1976
- Algorithm 360: shortest-path forest with topological ordering [H]Communications of the ACM, 1969
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959