Donald B. Johnson
Skip Abstract Section
Abstract
An assertion that Dijkstra's algorithm for shortest paths (adapted to allow arcs of negative weight) runs in O(n3) steps is disproved by showing a set of networks which take O(n2n) steps.
- 1 DIJKSTRA, E W. A note on two problems in connexion with graphs. Numer. Math. 1 (1959), 269-271.Google Scholar
- 2 :EDMONDS, J, AND KARe, R M Theoretical ~mprovements ~n algomthmic efficiency for network flow problems. J. ACM I9, 2 (Apr. 1972), 248-264 Google Scholar
- 3 FLOYD, R.W. Algomthm 97, shortest path. Comm ACM 5, 6 (June 1962), 345. Google Scholar
Index Terms
- A Note on Dijkstra's Shortest Path Algorithm
Recommendations
A Multiple Pairs Shortest Path Algorithm
The multiple pairs shortest path problem (MPSP) arises in many applications where the shortest paths and distances between only some specific pairs of origin-destination (OD) nodes in a network are desired. The traditional repeated single-source shortest ...
Generalization of Shortest Path Map
ITNG '10: Proceedings of the 2010 Seventh International Conference on Information Technology: New GenerationsWe consider the problem of constructing shortest path maps in two dimensions under angle constraint. Shortest path maps are used for planning short length paths from a fixed source point s to varying goal points. In the standard shortest path map the ...
Comments