More on k th shortest paths
Author:
Open Access
- 1 May 1975
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 18 (5) , 279
Abstract
In a recent paper [4], Minieka proposes an algorithm for finding k th shortest paths between all pairs of nodes in an N node network. His claimed time is O ( k 2 N 3 ).Keywords
This publication has 5 references indexed in Scilit:
- On computing sets of shortest paths in a graphCommunications of the ACM, 1974
- A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$SIAM Journal on Computing, 1973
- Finding All Shortest Distances in a Directed NetworkIBM Journal of Research and Development, 1972
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- Algorithm 232: HeapsortCommunications of the ACM, 1964