On shortest-path algorithms in the topological design of computer networks: a comparative study
- 1 January 1981
- journal article
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 12 (11) , 1379-1387
- https://doi.org/10.1080/00207728108963824
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the Topological Design of Distributed Computer NetworksIEEE Transactions on Communications, 1977
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975
- A Note on Yen's Algorithm for Finding the Length of All Shortest Paths in N -Node Nonnegative-Distance NetworksJournal of the ACM, 1973
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- A Decomposition Algorithm for Shortest Paths in a NetworkOperations Research, 1968
- A Theorem on Boolean MatricesJournal of the ACM, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- On a routing problemQuarterly of Applied Mathematics, 1958