The k shortest chains in a graph
- 31 March 1968
- journal article
- Published by Elsevier in Transportation Research
- Vol. 2 (1), 1-11
- https://doi.org/10.1016/0041-1647(68)90003-8
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Computing the N Best Loopless Paths in a NetworkJournal of the Society for Industrial and Applied Mathematics, 1963
- Solutions of the kth best route through a network — A reviewJournal of Mathematical Analysis and Applications, 1961
- Onkth Best PoliciesJournal of the Society for Industrial and Applied Mathematics, 1960
- A Method for the Solution of the N th Best Path ProblemJournal of the ACM, 1959