An efficient algorithm for K shortest simple paths
- 1 December 1982
- Vol. 12 (4), 411-427
- https://doi.org/10.1002/net.3230120406
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Comment on a computing the k shortest paths in a graphCommunications of the ACM, 1977
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- Iterative methods for determining the k shortest paths in a networkNetworks, 1976
- An algebra for determining all path-values in a network with application to K-shortest-paths problemsNetworks, 1976
- On computing sets of shortest paths in a graphCommunications of the ACM, 1974
- A Note on an Algebra for the k Best Routes in a NetworkIMA Journal of Applied Mathematics, 1973
- The shortest and the K‐shortest routes as assignment problemsNetworks, 1973
- Solutions of the kth best route through a network — A reviewJournal of Mathematical Analysis and Applications, 1961
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- A Method for the Solution of the N th Best Path ProblemJournal of the ACM, 1959