论文信息 - Graph algorithms on a tree-structured parallel computer

Graph algorithms on a tree-structured parallel computer

Parallel algorithms for some graph-theoretic problems on a tree-structured computer are presented. In particular, ifp denotes the number of processing elements, algorithms that run inO(n2/p) time for finding connected components, transitive closure and the minimum spanning tree of an undirected graph withn vertices are obtained.

D. T. Lee | D. Y. Yeh

[1] Joseph JáJá,et al. Fast, Efficient Parallel Algorithms for Some Graph Problems , 1981, SIAM J. Comput..

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

[3] Mikhail J. Atallah,et al. Graph problems on a mesh-connected processor array (Preliminary Version) , 1982, STOC '82.

[4] S. N. Maheshwari,et al. Parallel Algorithms for the Connected Components and Minimal Spanning Tree Problems , 1982, Inf. Process. Lett..

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

[6] Francis Y. L. Chin,et al. Efficient parallel algorithms for some graph problems , 1982, CACM.

[7] E. Reingold,et al. Combinatorial Algorithms: Theory and Practice , 1977 .

[8] H. T. Kung. The Structure of Parallel Algorithms , 1980, Adv. Comput..

[9] Jon Louis Bentley,et al. A Parallel Algorithm for Constructing Minimum Spanning Trees , 1980, J. Algorithms.

[10] Sartaj Sahni,et al. Parallel Matrix and Graph Algorithms , 1981, SIAM J. Comput..