Shortest-path problem is not harder than matrix multiplication
- 1 November 1980
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 11 (3) , 134-136
- https://doi.org/10.1016/0020-0190(80)90128-3
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Complexity measures for matrix multiplication algorithmsCalcolo, 1980
- An algorithm for finding all shortest paths using N2.81 infinite-precision multiplicationsInformation Processing Letters, 1976
- Boolean matrix multiplication and transitive closurePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1971
- Gaussian elimination is not optimalNumerische Mathematik, 1969