Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
A new upper bound on the complexity of the all pairs shortest path problem
Information Processing Letters
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)
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
All pairs shortest distances for graphs with small integer length edges
Information and Computation
All pairs lightest shortest paths
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Floats, Integers, and Single Source Shortest Paths
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Undirected single source shortest paths in linear time
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
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 almost shortest paths
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Computing shortest paths with comparisons and additions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM (JACM)
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths
ICALP '02 Proceedings of the 29th 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 new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
Journal of the ACM (JACM)
Fast sparse matrix multiplication
ACM Transactions on Algorithms (TALG)
Answering distance queries in directed graphs using fast matrix multiplication
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Finding a maximum weight triangle in n3-Δ time, with applications
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Fully dynamic all pairs shortest paths with real edge weights
Journal of Computer and System Sciences - Special issue on FOCS 2001
Fourier meets möbius: fast subset convolution
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
All-pairs bottleneck paths for general graphs in truly sub-cubic time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
More algorithms for all-pairs shortest paths in weighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Dynamic programming and fast matrix multiplication
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Language constrained graph problems: a microcosm of engineering research and development
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
All-pairs nearly 2-approximate shortest paths in O(n2polylogn) time
Theoretical Computer Science
Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximating Shortest Paths in Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Finding heaviest H-subgraphs in real weighted graphs, with applications
ACM Transactions on Algorithms (TALG)
Nondecreasing paths in a weighted graph or: How to optimally read a train schedule
ACM Transactions on Algorithms (TALG)
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
SIAM Journal on Computing
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
SIAM Journal on Computing
All-pairs shortest paths with a sublinear additive error
ACM Transactions on Algorithms (TALG)
A shortest cycle for each vertex of a graph
Information Processing Letters
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
All-pairs shortest paths with real weights in O(n3/ log n) time
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Some results on approximate 1-median selection in metric spaces
Theoretical Computer Science
Optimal distributed all pairs shortest paths and applications
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
ACM Transactions on Algorithms (TALG)
Deterministic sublinear-time approximations for metric 1-median selection
Information Processing Letters
| Hi-index | 0.01 |
We show that the All Pairs Shortest Paths (APSP) problem for undirected graphs with integer edge weights taken from the range \math can be solved using only a logarithmic number of distance products of matrices with elements in the range \math. As a result, we get an algorithm for the APSP problem in such graphs that runs in \math$ time, where n is the number of vertices in the input graph, M is the largest edge weight in the graph, and \math is the exponent of matrix multiplication. This improves, and also simplifies, an \math time algorithm of Galil and Margalit.