We present a systematic approach for solving graph problems under the network models. We illustrate this approach on the mesh-of-trees networks. It is known that under the CREW PRAM model, when a undirected graph of n nodes is given by an n by n adjacency matrix, the problems of finding minimum spanning forest, connected components, and biconnected components can all be solved with optimal speedup when the number of processors p ≤ n2/log2n. We show that for these problems, the same optimal speedup can be achieved even under the much more restrictive mesh-of-trees network. We also show that for the problem of finding directed spanning forest of arbitrary digraphs and the problem of testing strong connectivity of 1-reachable digraphs, near-optimal speedup can be achieved.
[1]
Uzi Vishkin,et al.
An O(log n) Parallel Connectivity Algorithm
,
1982,
J. Algorithms.
[2]
Frank Thomson Leighton,et al.
Parallel Computation Using Meshes of Trees
,
1983,
WG.
[3]
S. N. Maheshwari,et al.
Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
,
1983,
IEEE Transactions on Computers.
[4]
Francis Y. L. Chin,et al.
OPTIMAL PARALLEL ALGORITHMS FOR THE CONNECTED COMPONENT PROBLEM.
,
1981
.
[5]
Robert E. Tarjan,et al.
Depth-First Search and Linear Graph Algorithms
,
1972,
SIAM J. Comput..