The pairing heap: a new form of self-adjusting heap
Algorithmica
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
Mixed-approach algorithms for transitive closure (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A new upper bound on the complexity of the all pairs shortest path problem
Information Processing Letters
Finding the hidden path: time bounds for all-pairs shortest paths
SIAM Journal on Computing
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
Finding real-valued single-source shortest paths in o(n3 expected time
Journal of Algorithms
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
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
Fast priority queues for cached memory
Journal of Experimental Algorithmics (JEA)
Computing shortest paths with comparisons and additions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Improved Upper Bounds for Pairing Heaps
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
An Optimal Minimum Spanning Tree Algorithm
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Quick k-Median, k-Center, and Facility Location for Sparse Graphs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Improved Shortest Paths on the Word RAM
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
A scaling algorithm for weighted matching on general graphs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Shortest Path Algorithms: Engineering Aspects
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On the Comparison-Addition Complexity of All-Pairs Shortest Paths
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
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)
Terracost: Computing least-cost-path surfaces for massive grid terrains
Journal of Experimental Algorithmics (JEA)
Explicit routing in multicast overlay networks
Computer Communications
Efficient modified bidirectional algorithm for optimal route-finding
IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
Accomplishing approximate FCFS fairness without queues
HiPC'07 Proceedings of the 14th international conference on High performance computing
An edge-wise linear shortest path algorithm for non negative weighted undirected graphs
Proceedings of the 7th International Conference on Frontiers of Information Technology
| Hi-index | 0.00 |
We evaluate the practical efficiency of a new shortest path algorithm for undirected graphs which was developed by the first two authors. This algorithm works on the fundamental comparison-addition model.Theoretically, this new algorithm out-performs Dijkstra's algorithm on sparse graphs for the all-pairs shortest path problem, and more generally, for the problem of computing single-source shortest paths from 驴(1) different sources. Our extensive experimentalanal ysis demonstrates that this is also the case in practice. We present results which show the new algorithm to run faster than Dijkstra's on a variety of sparse graphs when the number of vertices ranges from a few thousand to a few million, and when computing single-source shortest paths from as few as three different sources.