Skip to main content
Log in

A linear systolic algorithm for the connected component problem

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

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 (np + 1) cells pipelined together to figure out, in (m + 3(np) + 2) systolic cycles, which component each vertex belongs to.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. 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.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. Hambrusch, S. E.,VLSI algorithms for the connected component problem, SIAM J. Comput., Vol. 12, No. 2, May 1983, pp. 354–365.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. Huang, S. T.,A fully-pipelined minimum-spanning-tree constructor, to appear in Journal of Parallel and Distributed Computing.

  6. 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.

  7. Quinn, M. J. and Deo, N.,Parallel graph algorithms, Computing Surveys, Vol. 16, No. 3, Sept. 1984, pp. 319–348.

    Google Scholar 

  8. Savage, C.,A systolic design for connectivity problems. IEEE Trans. on Computers, Vol. C-33, No. 1, Jan. 1984, pp. 99–104.

    Google Scholar 

  9. Shiloach, Y. and Vishikin, U.,An O(log n) parallel connectivity algorithm, J. Algorithms, Vol. 3, Mar. 1982, pp. 57–67.

    Google Scholar 

  10. 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.

    Google Scholar 

  11. 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.

Download references

Author information

Authors and Affiliations

Authors

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

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01952677

CR Categories

Key words

Navigation