All shortest distances in a graph. An improvement to Dantzig's inductive algorithm
- 31 December 1973
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 4 (1), 83-87
- https://doi.org/10.1016/0012-365x(73)90118-0
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- A note on two problems in connexion with graphsNumerische Mathematik, 1959