A new upper bound on the complexity of the all pairs shortest path problem
Information Processing Letters
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
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer 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
Improved algorithm for all pairs shortest paths
Information Processing Letters
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
The Floyd--Warshall algorithm on graphs with negative cycles
Information Processing Letters
A sub-cubic time algorithm for the k-maximum subarray problem
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
SIAM Journal on Computing
A family of skeletons for motion planning and geometric reasoning applications
Artificial Intelligence for Engineering Design, Analysis and Manufacturing - Representing and Reasoning About Three-Dimensional Space
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.89 |
This paper achieves O(n^3loglogn/logn) time for the all pairs shortest path problem on the conventional RAM model where only arithmetic operations, branching operations, and random accessibility with O(logn) bits are allowed.