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

Authors:
Yijie Han
Affiliations:
University of Missouri at Kansas City, School of Computing and Engineering, 5100 Rockhill Road, 64110, Kansas City, MO, USA
Venue:
Algorithmica
Year:
2008

Citing 0
Cited 5

The Floyd--Warshall algorithm on graphs with negative cycles

Information Processing Letters
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs

SIAM Journal on Computing
Efficient algorithms for the 2-center problems

ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
All-pairs shortest paths for unweighted undirected graphs in o(mn) time

ACM Transactions on Algorithms (TALG)
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an O(n 3(log log n/log n)5/4) time algorithm for all pairs shortest paths. This algorithm improves on the best previous result of O(n 3/log n) time.