An Improved Distribution Algorithm for Shortest Paths Problem
Lakani · IEEE Transactions on Computers · 1984
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.