A Simple Shortest Path Algorithm with Linear Average Time

Authors:
Andrew V. Goldberg
Affiliations:
-
Venue:
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Year:
2001

Citing 19
Cited 7

Data structures and network algorithms

Data structures and network algorithms
Scaling algorithms for network problems

Journal of Computer and System Sciences
Deterministic coin tossing with applications to optimal parallel list ranking

Information and Control
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Faster algorithms for the shortest path problem

Journal of the ACM (JACM)
Trans-dichotomous algorithms for minimum spanning trees and shortest paths

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Randomized algorithms

Randomized algorithms
Shortest paths algorithms: theory and experimental evaluation

Mathematical Programming: Series A and B
Recent results on the single-source shortest paths problem

ACM SIGACT News
Buckets, Heaps, Lists, and Monotone Priority Queues

SIAM Journal on Computing
Undirected single-source shortest paths with positive integer weights in linear time

Journal of the ACM (JACM)
Algorithm 360: shortest-path forest with topological ordering [H]

Communications of the ACM
Worst case constant time priority queue

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Single-source shortest-paths on arbitrary directed graphs in linear average-case time

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
On RAM Priority Queues

SIAM Journal on Computing
Improved Shortest Paths on the Word RAM

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Priority Queues: Small, Monotone and Trans-dichotomous

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Shortest Path Algorithms: An Evaluation Using Real Road Networks

Transportation Science

Buckets Strike Back: Improved Parallel Shortest Paths

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Point-to-Point Shortest Path Algorithms with Preprocessing

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes

Graph-Theoretic Concepts in Computer Science
Goal-directed shortest-path queries using precomputed cluster distances

Journal of Experimental Algorithmics (JEA)
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing

Journal of Discrete Algorithms
Memory-efficient A*-search using sparse embeddings

Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Multithreaded Asynchronous Graph Traversal for In-Memory and Semi-External Memory

Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis

Quantified Score

Hi-index	0.00

Visualization

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.