论文信息 - A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application

A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application

We design a faster algorithm for the all-pairs shortest path problem under the RAM model, based on distance matrix multiplication (DMM). Specifically we improve the best known time complexity of O(n 3(loglog n/log n)1/2) to T(n)=O(n 3(loglog n)2/log n). We extend the algorithm to a parallel algorithm for DMM, whose time complexity is O(log n) and number of processors is T(n)/log n. As an application, we show how to speed up the algorithm for the maximum subarray problem.

Tadao Takaoka

[1] Hisao Tamaki,et al. Algorithms for the maximum subarray problem based on matrix multiplication , 1998, SODA '98.

[2] 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).

[3] Noga Alon,et al. On the Exponent of the All Pairs Shortest Path Problem , 1991, J. Comput. Syst. Sci..

[4] Alistair Moffat,et al. An All Pairs Shortest Path Algorithm with Expected Time O(n² log n) , 1987, SIAM J. Comput..

[5] Selim G. Akl,et al. Design and analysis of parallel algorithms , 1985 .

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

[7] Tadao Takaoka,et al. Subcubic Cost Algorithms for the All Pairs Shortest Path Problem , 1998, Algorithmica.

[8] Yijie Han,et al. Efficient parallel algorithms for computing all pair shortest paths in directed graphs , 1992, SPAA '92.

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

[10] Jon Louis Bentley. Programming pearls: perspective on performance , 1984, CACM.