Cited By
View all- Myoupo JSemé D(2006)Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theoryThe Journal of Supercomputing10.1007/s11227-006-9157-538:1(83-107)Online publication date: 1-Oct-2006
A linear systolic algorithm for the connected component problem
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.
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.
[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.
[3]
Hambrusch, S. E.,VLSI algorithms for the connected component problem, SIAM J. Comput., Vol. 12, No. 2, May 1983, pp. 354–365.
[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.
[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.
[8]
Savage, C.,A systolic design for connectivity problems. IEEE Trans. on Computers, Vol. C-33, No. 1, Jan. 1984, pp. 99–104.
[9]
Shiloach, Y. and Vishikin, U.,An O(log n) parallel connectivity algorithm, J. Algorithms, Vol. 3, Mar. 1982, pp. 57–67.
[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.
[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.
Index Terms
- A linear systolic algorithm for the connected component problem
Index terms have been assigned to the content through auto-classification.
Recommendations
A fully-pipelined systolic algorithm for finding bridges on an undirected connected graph
A new fully-pipelined systolic algorithm for finding all the bridges of an undirected connected graph is proposed. Given a graph of n vertices and m edges, the proposed algorithm uses (2n-2) systolic cells and runs in (m + 3n - 3) systolic cycles. This ...
Approximation algorithm for the balanced 2-connected k-partition problem
For two positive integers m,k and a connected graph G=(V,E) with a nonnegative vertex weight function w, the balanced m-connected k-partition problem, denoted as BCmPk, is to find a partition of V into k disjoint nonempty vertex subsets (V1,V2,,Vk) such ...
A linear time algorithm for liar's domination problem in proper interval graphs
Let G=(V,E) be a graph without isolated vertices and having at least 3 vertices. A set L@?V(G) is a liar@?s dominating set if (1) |N"G[v]@?L|>=2 for all v@?V(G), and (2) |(N"G[u]@?N"G[v])@?L|>=3 for every pair u,v@?V(G) of distinct vertices in G, where ...
Comments
Information & Contributors
Information
Published In
Copyright © 1989 BIT Foundations.
Publisher
BIT Computer Science and Numerical Mathematics
United States
Publication History
Published: 01 June 1989
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 13 Nov 2024
Other Metrics
Citations
Cited By
View all- Myoupo JSemé D(2006)Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theoryThe Journal of Supercomputing10.1007/s11227-006-9157-538:1(83-107)Online publication date: 1-Oct-2006
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in