A k shortest path algorithm for adaptive routing in communications networks
- 1 July 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 36 (7), 855-859
- https://doi.org/10.1109/26.2815
Abstract
No abstract availableThis publication has 26 references indexed in Scilit:
- A k shortest path algorithm for adaptive routing in communications networksIEEE Transactions on Communications, 1988
- K best solutions to combinatorial optimization problemsAnnals of Operations Research, 1985
- Parametric shortest path algorithms with an application to cyclic staffingDiscrete Applied Mathematics, 1981
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973
- Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM, 1973
- The shortest and the K‐shortest routes as assignment problemsNetworks, 1973
- On shortest paths and sortingPublished by Association for Computing Machinery (ACM) ,1972
- Finding the K Shortest Loopless Paths in a NetworkManagement Science, 1971
- Methods for Investigating Connectivity of Large GraphsIEEE Transactions on Circuit Theory, 1969