论文信息 - A linear systolic algorithm for the connected component problem

A linear systolic algorithm for the connected component problem

A linear systolic algorithm is proposed for the connected component problem. Given an undirected graph withn vertices,m edges, andp connected components, the proposed algorithm uses (n −p + 1) cells pipelined together to figure out, in (m + 3(n −p) + 2) systolic cycles, which component each vertex belongs to.

Shing-Tsaan Huang | Ming-Shin Tsai | Ming-Shin Tsai | Shing-Tsaan Huang

[1] Uzi Vishkin,et al. An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.

[2] Carla D. Savage,et al. Systolic Arrays with Embedded Tree Structures for Connectivity Problems , 1985, IEEE Transactions on Computers.

[3] Susanne E. Hambrusch. VLSI Algorithms for the Connected Component Problem , 1983, SIAM J. Comput..

[4] Shing-Tsaan Huang,et al. A Fully Pipelined Minimum-Spanning-Tree Constructor , 1990, J. Parallel Distributed Comput..

[5] Baruch Awerbuch,et al. New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM , 1987, IEEE Transactions on Computers.

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

[7] Carla D. Savage. A Systolic Design for Connectivity Problems , 1984, IEEE Transactions on Computers.

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

[9] Robert E. Tarjan,et al. Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[10] Michael J. Quinn,et al. Parallel graph algorithms , 1984, CSUR.