An O(n3log logn/logn) time algorithm for the all-pairs shortest path problem

Authors:
Tadao Takaoka
Affiliations:
Department of Computer Science, University of Canterbury, Christchurch, New Zealand
Venue:
Information Processing Letters
Year:
2005

Citing 5
Cited 1

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

A note of an O(n3/logn) time algorithm for all pairs shortest paths

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper achieves O(n3 loglogn/log n) time for the all pairs shortest path problem on the conventional RAM model where only arithmetic operations, branching operations, and random accessibility with O(log n) bits are allowed.