Issue No. 09 - September (1982 vol. 31)
C.C. Chen , Department of Electrical Engineering and Computer Science, Stevens Institute of Technology
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.
shortest paths, Distributed computation
C. Chen, "A Distributed Algorithm for Shortest Paths," in IEEE Transactions on Computers, vol. 31, no. , pp. 898-899, 1982.