Scaling algorithms for network problems
Journal of Computer and System Sciences
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Faster scaling algorithms for network problems
SIAM Journal on Computing
Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
Introduction to algorithms
Planar graph decomposition and all pairs shortest paths
Journal of the ACM (JACM)
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 in the plane with polygonal obstacles
Journal of the ACM (JACM)
Scaling Algorithms for the Shortest Paths Problem
SIAM Journal on Computing
On the all-pairs-shortest-path problem in unweighted undirected graphs
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Lower bounds for the union-find and the split-find problem on pointer machines
Journal of Computer and System Sciences
All pairs shortest paths for graphs with small integer length edges
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
On the exponent of the all pairs shortest path problem
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
Recent results on the single-source shortest paths problem
ACM SIGACT News
Faster shortest-path algorithms for planar graphs
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Buckets, heaps, lists, and monotone priority queues
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Shortest paths in an arrangement with k line orientations
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
Information Bounds Are Weak in the Shortest Distance Problem
Journal of the ACM (JACM)
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
SIAM Journal on Computing
Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
SIAM Journal on Computing
A minimum spanning tree algorithm with inverse-Ackermann type complexity
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Priority Queues: Small, Monotone and Trans-dichotomous
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
All Pairs Shortest Paths in weighted directed graphs ? exact and almost exact algorithms
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
All Pairs Shortest Paths in Undirected Graphs with Integer Weights
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Planar Graphs, Negative Weight Edges, Shortest Paths, and Near Linear Time
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Compact Oracles for Reachability and Approximate Distances in Planar Digraphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Computing Undirected Shortest Paths with Comparisons and Additions
Computing Undirected Shortest Paths with Comparisons and Additions
The effect of algebraic structure on the computational complexity of matrix multiplication
The effect of algebraic structure on the computational complexity of matrix multiplication
An optimal minimum spanning tree algorithm
Journal of the ACM (JACM)
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
Improved Distance Oracles for Avoiding Link-Failure
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Experimental Evaluation of a New Shortest Path Algorithm
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
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
Cache-oblivious shortest paths in graphs using buffer heap
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
Incremental computation of shortest paths in semi-dynamic graphs using software components
Proceedings of the 44th annual Southeast regional conference
I/O-efficient undirected shortest paths with unbounded edge lengths
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Terracost: Computing least-cost-path surfaces for massive grid terrains
Journal of Experimental Algorithmics (JEA)
Strongly polynomial-time truthful mechanisms in one shot
Theoretical Computer Science
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
Approximate mechanisms for the graphical TSP and other graph traversal problems
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Strongly polynomial-time truthful mechanisms in one shot
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Cache-oblivious planar shortest paths
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A truthful (2 - 2/k)-approximation mechanism for the steiner tree problem with k terminals*
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Efficient truthful mechanisms for the single-source shortest paths tree problem
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |
We present an undirected all-pairs shortest paths (APSP) algorithm which runs on a pointer machine in time O(mnα(m,n)) while making O(mnlog α(m, n)) comparisons and additions, where m and n are the number of edges and vertices, respectively, and α(m, n) is Tarjan's inverse-Ackermann function. This improves upon all previous comparison & addition-based APSP algorithms when the graph is sparse, i.e., when m = o(n log n).At the heart of our APSP algorithm is a new single-source shortest paths algorithm which runs in time O(mα(m, n) + n log log r) on a pointer machine, where r is the ratio of the maximum-to-minimum edge length. So long as r no(1) this algorithm is faster than any implementation of Dijkstra's classical algorithm in the comparison-addition model.For directed graphs we give an O(m + n log r)-time comparison & addition-based SSSP algorithm on a pointer machine. Similar algorithms assuming integer weights or the RAM model were given earlier.