Lower bounds for sorting on mesh-connected architectures
Acta Informatica
Minimum-cost spanning tree as a path-finding problem
Information Processing Letters
Graph Problems on a Mesh-Connected Processor Array
Journal of the ACM (JACM)
Sorting on a mesh-connected parallel computer
Communications of the ACM
A Mesh-Connected Area-Time Optimal VLSI Multiplier of Large Integers
IEEE Transactions on Computers
Systolic Sorting on a Mesh-Connected Network
IEEE Transactions on Computers
| Hi-index | 0.00 |
We present a solution for the following problem: given an undirected bridgeless connected graph G = (V, E), find an orientation of each edge such that the resulting directed graph is strongly connected. We assume the input graph to be given as an adjacency matrix stored in the processors of a mesh connected processor array such that each processor contains one entry. Our algorithm is a modification of Tarjan and Vishkin's strong orientation method [13] for a CREW PRAM. It takes time O(n) for an n-vertex graph which is asymptotically optimal for the considered computer model.