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
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Communications of the ACM
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)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Improved Dynamic Reachability Algorithms for Directed Graphs
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
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
All Pairs Shortest Paths in Undirected Graphs with Integer Weights
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
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
An O(n3 (loglogn/logn)5/4) time algorithm for all pairs shortest paths
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On the K-simple shortest paths problem in weighted directed graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A sub-cubic time algorithm for the k-maximum subarray problem
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
On the complexity of the “most general” firing squad synchronization problem
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Improved algorithms for the K-maximum subarray problem for small K
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
All-pairs nearly 2-approximate shortest-paths in O(n2 polylog n) time
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
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
Efficient algorithms for the 2-center problems
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
An O(n3 log log n/ log2 n) time algorithm for all pairs shortest paths
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We present an $O(n^{3}\sqrt{{\rm log log}n}/{\rm log} n)$ time algorithm for the All Pairs Shortest Paths (APSP) problem for directed graphs with real edge lengths This improves, by a factor of about $\sqrt{{\rm log} n}$, previous algorithms for the problem obtained by Fredman, Takaoka and Dobosiewicz.