A Note on Yen's Algorithm for Finding the Length of All Shortest Paths in N -Node Nonnegative-Distance Networks
From MaRDI portal
Publication:5681921
DOI10.1145/321765.321769zbMath0265.94017MaRDI QIDQ5681921
Gregory P. White, Thomas A. Williams
Publication date: 1973
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321765.321769
Related Items
Decomposition algorithms for finding the shortest path between a source node and a sink node of a network, Shortest-path algorithms: Taxonomy and annotation, On shortest-path algorithms in the topological design of computer networks: a comparative study