On shortest-path algorithms in the topological design of computer networks: a comparative study

DOI10.1080/00207728108963824zbMath0463.68062OpenAlexW1983774105MaRDI QIDQ3914451

Inder M. Soi, K. K. Aggarwal

Publication date: 1981

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207728108963824

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Applications of graph theory to circuits and networks (94C15) Theory of software (68N99)

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• A Decomposition Algorithm for Shortest Paths in a Network
• An Appraisal of Some Shortest-Path Algorithms
• A Note on Yen's Algorithm for Finding the Length of All Shortest Paths in N -Node Nonnegative-Distance Networks
• A Theorem on Boolean Matrices

This page was built for publication: On shortest-path algorithms in the topological design of computer networks: a comparative study