Graphs and algorithms
Minimum-cost spanning tree as a path-finding problem
Information Processing Letters
Mesh-connected array processors with bypass capability for signal/image processing
Proceedings of the Twenty-First Annual Hawaii International Conference on Architecture Track
Polymorphic-Torus Architecture for Computer Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Connection autonomy in SIMD computers: a VLSI implementation
Journal of Parallel and Distributed Computing
Fast and efficient solution of path algebra problems
Journal of Computer and System Sciences
IEEE Transactions on Computers
A Unified Approach to Path Problems
Journal of the ACM (JACM)
IEEE Transactions on Parallel and Distributed Systems
Solving An Algebraic Path Problem and Some Related Graph Problems on a Hyper-Bus Broadcast Network
IEEE Transactions on Parallel and Distributed Systems
Efficient List Ranking Algorithms on Reconfigurable Mesh
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
| Hi-index | 0.00 |
The algebraic path problem is a general description of a class of problems, including some important graph problems such as transitive closure, all pairs shortest paths, minimum spanning tree, etc. In this work, the algebraic path problem is solved on a processor array with a reconfigurable bus system. The proposed algorithms are based on repeated matrix multiplications. The multiplication of two n*n matrices takes O(log n) time in the worst case, but, for some special cases, O(1) time is possible. It is shown that three instances of the algebraic path problem, transitive closure, all pairs shortest paths, and minimum spanning tree, can be solved in O(log n) time, which is as fast as on the CRCW PRAM.