A fast algortihm for finding all shortest paths
- 27 October 1981
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 13 (1) , 1-3
- https://doi.org/10.1016/0020-0190(81)90139-3
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Shortest-path problem is not harder than matrix multiplicationInformation Processing Letters, 1980
- An algorithm for finding all shortest paths using N2.81 infinite-precision multiplicationsInformation Processing Letters, 1976
- Gaussian elimination is not optimalNumerische Mathematik, 1969