This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Distributed Algorithm for Shortest Paths
September 1982 (vol. 31 no. 9)
pp. 898-899
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.
Index Terms:
shortest paths, Distributed computation
Citation:
C.C. Chen, "A Distributed Algorithm for Shortest Paths," IEEE Transactions on Computers, vol. 31, no. 9, pp. 898-899, Sept. 1982, doi:10.1109/TC.1982.1676107
Usage of this product signifies your acceptance of the Terms of Use.