论文信息 - A Distributed Algorithm for Shortest Paths

A Distributed Algorithm for Shortest Paths

Assuming that there is one processor at each vertex and all of these processors are synchronized, we can have a distributed algorithm for finding all the shortest paths in time O( d · p2) where d is the maximum of the degrees of vertices and p is the number of vertices.

Chen

[1] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

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

[4] L. R. Kerr. The Effect of Algebraic Structure on the Computational Complexity of Matrix Multiplication , 1970 .

[5] Philip M. Spira,et al. On Finding and Updating Shortest Paths and Spanning Trees , 1973, SWAT.