The Community for Technology Leaders
Green Image
Issue No. 09 - September (1984 vol. 33)
ISSN: 0018-9340
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.
VLSI layout, Distributed algorithms, pipelining, shortest paths computation, systolic architecture

G. Lakani, "An Improved Distribution Algorithm for Shortest Paths Problem," in IEEE Transactions on Computers, vol. 33, no. , pp. 855-857, 1984.
92 ms
(Ver 3.3 (11022016))