Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
An all pairs shortest path algorithm with expected time O(n2logn)
SIAM Journal on Computing
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
On the all-pairs shortest-path algorithm of Moffat and Takaoka
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
Recent results on the single-source shortest paths problem
ACM SIGACT News
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
Average-case complexity of shortest-paths problems in the vertex-potential model
Random Structures & Algorithms
Algorithm 360: shortest-path forest with topological ordering [H]
Communications of the ACM
SIAM Journal on Computing
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
Shortest Path Algorithms: Engineering Aspects
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Experimental Evaluation of a New Shortest Path Algorithm
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
A Simple Shortest Path Algorithm with Linear Average Time
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Geometric containers for efficient shortest-path computation
Journal of Experimental Algorithmics (JEA)
Combining speed-up techniques for shortest-path computations
Journal of Experimental Algorithmics (JEA)
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
Studying (non-planar) road networks through an algorithmic lens
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Linear-time algorithms for geometric graphs with sublinearly many crossings
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Hybrid shortest path algorithm for vehicle navigation
The Journal of Supercomputing
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
Journal of Discrete Algorithms
A faster algorithm for the single source shortest path problem with few distinct positive lengths
Journal of Discrete Algorithms
Engineering fast route planning algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Memory-efficient A*-search using sparse embeddings
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
The quest for a linear-time single-source shortest-path (SSSP) algorithm on directed graphs with positive edge weights is an ongoing hot research topic. While Thorup recently found an &Ogr;(n + m) time RAM algorithm for undirected graphs with n nodes, m edges and integer edge weights in {0,…,2w - 1} where w denotes the word length, the currently best time bound for directed sparse graphs on a RAM is &Ogr;(n + m · log log n).In the present paper we study the average-case complexity of SSSP. We give a simple algorithm for arbitrary directed graphs with random edge weights uniformly distributed in [0, 1] and show that it needs linear time &Ogr;(n + m) with high probability.