Abstract

We present a simple shortest path algorithm. If the input lengths are positive and uniformly distributed, the algorithm runs in linear time. The worst-case running time of the algorithm is O(m + n log C), where n and m are the number of vertices and arcs of the input graph, respectively, and C is the ratio of the largest and the smallest nonzero arc length.

Citations

2172	The design and analysis of computer algorithms - Aho, Hopcroft, et al. - 1974
1567	Randomized Algorithms - Motwani, Raghavan - 1995
1011	A note on two problems in connexion with graphs. Numerische Mathematik 1: 269–271 - Dijkstra - 1959
622	Flows in Networks - Ford, Fulkerson - 1962
589	A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations - Chernoff - 1952
493	Fibonacci heaps and their uses in improved network optimization algorithms - Fredman, Tarjan - 1987
141	Trans-dichotomous algorithms for minimum spanning trees and shortest paths - Fredman, Willard - 1990
124	Shortest Paths Algorithms: Theory and Experimental - Cherkassky, Goldberg, et al. - 1996
96	Deterministic coin tossing with applications to optimal parallel list ranking - Cole, Vishkin - 1986
91	Faster algorithms for the shortest path problem - Ahuja, Mehlhorn, et al.
69	Algorithm 360: Shortest-Path Forest with Topological Ordering - Dial
56	A measure of asymptotic eciency for test of a hypothesis based on the sum of observations - Cherno - 1952
53	Scaling algorithms for network problems - Gabow - 1983
51	Shortest paths algorithms - Gallo, Pallottino - 1988
39	Priority queues: small, monotone and trans-dichotomous - Raman - 1996
36	Negative-cycle detection algorithms - Cherkassky, Goldberg - 1996
35	A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees. Networks - Dial, Glover, et al. - 1979
25	Network Flow Theory - Ford - 1956
24	Single-source shortest-paths on arbitrary directed graphs in linear average-case time - Meyer - 2001
22	Improved shortest paths on the word RAM - Hagerup
16	monotone priority queues - Buckets, lists
16	Computational study of an improved shortest path algorithm - Glover, Glover, et al. - 1984
14	Implementations of Dijkstra's Algorithm Based on Multi-Level Buckets - Goldberg, Silverstein - 1997
13	Shortest-Route Methods: 1 - Denardo, Fox - 1979
11	Worst case constant time priority queue - Brodnik, Carlsson, et al. - 2001
10	A theorem on the expected complexity of Dijkstra's shortest path algorithm - Noshita - 1985
9	Economical algorithm for finding shortest paths in a network, In - Dinic - 1978
5	Fast Algorithms for Shortest Paths and Sorting - Raman - 1996
2	Transportation Modeling Systems, pages 36- 44. Institute for System Studies - Popkov, Shmulyian, et al. - 1978