Abstract
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.
Similar content being viewed by others
References
Awerbuch, B. and Shiloach, Y.,New connectivity and MSF algorithms for shuffle-exchange network, and PRAM, IEEE Trans. on Computers. Vol. C-36, No. 10, Oct. 1987, pp. 1258–1263.
Ashtaputre, S. and Savage, C. D.,Systolic arrays with embedded tree structures for connectivity problems, IEEE Trans. on Computers, Vol. C-34, No. 5, May 1985, pp. 438–484.
Hambrusch, S. E.,VLSI algorithms for the connected component problem, SIAM J. Comput., Vol. 12, No. 2, May 1983, pp. 354–365.
Hirschberg, D. S., Chandra, A. K. and Sarwate, D. V.,Computing connected components on parallel computers, Comm. of ACM, Vol. 22, No. 8, Aug. 1979, pp. 461–464.
Huang, S. T.,A fully-pipelined minimum-spanning-tree constructor, to appear in Journal of Parallel and Distributed Computing.
Nassimi, D. and Sahni, S.,Finding connected components and connected ones on a mesh-connected parallel computer, SIAM J. Comput., Vol. 9, No. 4, Nov. 19, pp. 744–757.
Quinn, M. J. and Deo, N.,Parallel graph algorithms, Computing Surveys, Vol. 16, No. 3, Sept. 1984, pp. 319–348.
Savage, C.,A systolic design for connectivity problems. IEEE Trans. on Computers, Vol. C-33, No. 1, Jan. 1984, pp. 99–104.
Shiloach, Y. and Vishikin, U.,An O(log n) parallel connectivity algorithm, J. Algorithms, Vol. 3, Mar. 1982, pp. 57–67.
Tarjan, R. E.,On the efficiency of a good but not linear set union algorithm, J. ACM, Vol. 22, No. 2, April 1975, pp. 215–225.
Tchuente, M. and Melkemi, L.,Reseaux systoliques pour le calcul des composantes connexes et la triangularisation des matrices bandes, R.R. No. 366, Centre National de la Recherche Scientifique Université Scientifique et Médicale de Grenoble, Institut National Polytechnique de Grenoble, Mar. 1983.
Author information
Authors and Affiliations
Additional information
This research was supported by the National Science Council of the Republic of China under the Contract NSC77-0408-E007-01.
Rights and permissions
About this article
Cite this article
Huang, ST., Tsai, MS. A linear systolic algorithm for the connected component problem. BIT 29, 217–226 (1989). https://doi.org/10.1007/BF01952677
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01952677