The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1984 vol.33)
pp: 855-857
G.D. Lakani , Department of Electrical Engineering and Computer Science, Texas Tech University
ABSTRACT
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, September 1984, doi:10.1109/TC.1984.1676503
33 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool