This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
September 1984 (vol. 33 no. 9)
pp. 855-857
G.D. Lakani, Department of Electrical Engineering and Computer Science, Texas Tech University
The time complexity of a distributed algorithm [5] for all-pair shortest path problem is improved by a factor 0(n) by pipelining instructions. Its implementation using VLSI technology is proposed and area complexity is computed.
Index Terms:
VLSI layout, Distributed algorithms, pipelining, shortest paths computation, systolic architecture
Citation:
G.D. Lakani, "An Improved Distribution Algorithm for Shortest Paths Problem," IEEE Transactions on Computers, vol. 33, no. 9, pp. 855-857, Sept. 1984, doi:10.1109/TC.1984.1676503
Usage of this product signifies your acceptance of the Terms of Use.