Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
- 1 January 1999
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 28 (4) , 1167-1181
- https://doi.org/10.1137/s0097539796303421
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- Gaussian elimination is not optimalNumerische Mathematik, 1969