An O(n3 log log n/ log2 n) time algorithm for all pairs shortest paths

Authors:
Yijie Han;Tadao Takaoka
Affiliations:
School of Computing and Engineering, University of Missouri at Kansas City, Kansas City, MO;Department of Computer Science and Software Engineering, University of Canterbury, Christchurch, New Zealand
Venue:
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Year:
2012

Citing 21
Cited 3

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
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 distances for graphs with small integer length edges

Information and Computation
Improved parallel integer sorting without concurrent writing

Information and Computation
Undirected single-source shortest paths with positive integer weights in linear time

Journal of the ACM (JACM)
All pairs shortest paths using bridging sets and rectangular matrix multiplication

Journal of the ACM (JACM)
Data Structures and Algorithms

Data Structures and Algorithms
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
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
Improved algorithm for all pairs shortest paths

Information Processing Letters
A Shortest Path Algorithm for Real-Weighted Undirected Graphs

SIAM Journal on Computing
Answering distance queries in directed graphs using fast matrix multiplication

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
More algorithms for all-pairs shortest paths in weighted graphs

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A note of an O(n3/logn) time algorithm for all pairs shortest paths

Information Processing Letters
An O(n 3(log log n/log n)5/4) Time Algorithm for All Pairs Shortest Path

Algorithmica
Sorting networks and their applications

AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem

Information Processing Letters
Shortest paths in matrix multiplication time

ESA'05 Proceedings of the 13th annual European conference on 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
A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

A simplified algorithm for the all pairs shortest path problem with O(n2logn) expected time

Journal of Combinatorial Optimization
Approximating the diameter of planar graphs in near linear time

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an O(n3 loglogn/log2n) time algorithm for all pairs shortest paths. This algorithm improves on the best previous result of O(n3 (loglogn)3/log2n) time.