On the Exponent of the All Pairs Shortest Path Problem
- 1 April 1997
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 54 (2) , 255-262
- https://doi.org/10.1006/jcss.1997.1388
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the all-pairs-shortest-path problemPublished by Association for Computing Machinery (ACM) ,1992
- Faster algorithms for the shortest path problemJournal of the ACM, 1990
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Scaling algorithms for network problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- An algorithm for finding all shortest paths using N2.81 infinite-precision multiplicationsInformation Processing Letters, 1976
- New Bounds on the Complexity of the Shortest Path ProblemSIAM Journal on Computing, 1976
- Gaussian elimination is not optimalNumerische Mathematik, 1969
- A note on two problems in connexion with graphsNumerische Mathematik, 1959