Tree-Based Graph Algorithms for Some Parallel Computers

This paper gives several optimal mesh computer, VLSI, and pyramid computer algorithms for determining properties of an arbitrary undirected graph, where the graph is given as an unordered collection of edges. The algorithms first find spanning trees and then use them to determine properties of the graph. By using edges, instead of requiring an entire adjacency matrix, these algorithms use only time on a 2-dimensional mesh, instead of the time required with matrix input. Further, the edge-based algorithms extend naturally to meshes of arbitrary dimension ,fi nishing in time. All of the times are optimal, and the algorithms extend to VLSI and pyramid models.

[1]  Frances L. Van Scoy.  The Parallel Recognition of Classes of Graphs , 1980, IEEE Trans. Computers.

[2]  Russ Miller,et al.  Geometric Algorithms for Digitized Pictures on a Mesh-Connected Computer , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  John H. Reif,et al.  Depth-First Search is Inherently Sequential , 1985, Inf. Process. Lett..

[4]  Quentin F. Stout.  Topological matching , 1983, STOC '83.

[5]  Russ Miller,et al.  Varying Diameter and Problem Size in Mesh-Connected Computers , 1985, ICPP.

[6]  Russ Miller,et al.  Data Movement Techniques for the Pyramid Computer , 1987, SIAM J. Comput..

[7]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1976, STOC '76.

[8]  Robert E. Tarjan,et al.  Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) , 1984, FOCS.

[9]  Alok Aggarwal.  A Comparative Study of X-Tree, Pyramid and Related Machines , 1984, FOCS.

[10]  Franco P. Preparata,et al.  A Critique and an Appraisal of VLSI Models of Computation. , 1981 .

[11]  Quentin F. Stout.  Sorting, Merging, Selecting, and Filtering on Tree and Pyramid Machines , 1983, ICPP.

[12]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[13]  Mikhail J. Atallah,et al.  Graph Problems on a Mesh-Connected Processor Array , 1984, JACM.

[14]  Dilip V. Sarwate,et al.  Computing connected components on parallel computers , 1979, CACM.

[15]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1977, CACM.

[16]  Joseph JáJá.  The VLSI Complexity of Selected Graph Problems , 1984, JACM.

[17]  Sartaj Sahni,et al.  Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer , 1980, SIAM J. Comput..