On finding shortest paths in nonnegative networks
- 31 December 1974
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 10 (1) , 159-162
- https://doi.org/10.1016/0012-365x(74)90027-2
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- All shortest distances in a graph. An improvement to Dantzig's inductive algorithmDiscrete Mathematics, 1973