On shortest-path algorithms in the topological design of computer networks: a comparative study
From MaRDI portal
Publication:3914451
DOI10.1080/00207728108963824zbMath0463.68062MaRDI QIDQ3914451
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
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
94C15: Applications of graph theory to circuits and networks
68N99: Theory of software