Solving graph theory problems using reconfigurable pipelined optical buses
We serve a number of important and interesting problems from graph theory on a linear array with a reconfigurable pipelined optical bus system. Our algorithms are based on fast matrix multiplication and extreme value finding algorithms, and are currently the fastest algorithms. We also distinguish the two cases where weights have bounded/unbounded magnitude and precision. (C) 2000 Published by Elsevier Science B.V. All rights reserved.
graph algorithms pipelined communication reconfigurable networks optical computing