The Cascade Algorithm for Finding all Shortest Distances in a Directed Graph
Published Online:1 Sep 1967https://doi.org/10.1287/mnsc.14.1.19
- Cited by
- 27 December 2024 | International Transactions in Operational Research, Vol. 32, No. 4
- 15 August 2011
- Pesquisa Operacional, Vol. 22, No. 1
- International Journal of Systems Science, Vol. 17, No. 6
- Discrete Applied Mathematics, Vol. 13, No. 2-3
- Zeitschrift für Operations Research, Vol. 22, No. 1
- 3 September 2010 | Geographical Analysis, Vol. 9, No. 3
- 29 March 2011 | Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle, Vol. 10, No. V2
- 9 March 2007 | Networks, Vol. 2, No. 2
- 7 June 2007 | Decision Sciences, Vol. 3, No. 1
- Unternehmensforschung Operations Research - Recherche Opérationnelle, Vol. 15, No. 1
- 5 March 2008 | Canadian Geographies / Géographies canadiennes, Vol. 15, No. 1
- Computing, Vol. 6, No. 3-4
- IEEE Transactions on Computers, Vol. C-19, No. 1
- IEEE Transactions on Circuit Theory, Vol. 16, No. 1
- USSR Computational Mathematics and Mathematical Physics, Vol. 8, No. 5
Volume 14, Issue 1
September 1967
Pages 5-125
Article Information
Metrics
Information
- Published Online:September 01, 1967
© 1967 INFORMS
Cite as
B. A. Farbey, A. H. Land, J. D. Murchland, (1967) The Cascade Algorithm for Finding all Shortest Distances in a Directed Graph. Management Science 14(1):19-28.
https://doi.org/10.1287/mnsc.14.1.19
