论文信息 - Improved algorithm for all pairs shortest paths

Improved algorithm for all pairs shortest paths

We present an improved algorithm for all pairs shortest paths. For a graph of n vertices our algorithm runs in O(n3(log log n/log n)5/7) time. This improves the best previous result which runs in O(n3(log log n/log n)1/2) time.

Yijie Han | Yijie Han

[1] Tadao Takaoka,et al. A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem , 1991, Inf. Process. Lett..

[2] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .

[3] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[4] Uri Zwick,et al. All pairs shortest paths in weighted directed graphs-exact and almost exact algorithms , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[5] Seth Pettie,et al. A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs , 2002, ICALP.

[6] Michael L. Fredman,et al. New Bounds on the Complexity of the Shortest Path Problem , 1976, SIAM J. Comput..

[7] Raimund Seidel,et al. On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs , 1995, J. Comput. Syst. Sci..

[8] Zvi Galil,et al. All Pairs Shortest Distances for Graphs with Small Integer Length Edges , 1997, Inf. Comput..

[9] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[10] W. Dobosiewicz. A more efficient algorithm for the min-plus multiplication , 1990 .

[11] Mikkel Thorup,et al. Undirected single source shortest paths in linear time , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.