The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Computing connected components on parallel computers
Open accessAbstract
We present a parallel algorithm which uses n 2 processors to find the connected components of an undirected graph with n vertices in time O (log 2 n ). An O (log 2 n ) time bound also can be achieved using only n ⌈ n /⌈log 2 n ⌉⌉ processors. The algorithm can be used to find the transitive closure of a symmetric Boolean matrix. We assume that the processors have access to a common memory. Simultaneous access to the same location is permitted for fetch instructions but not for store instructions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Sorting networks and their applications
Batcher, K. E. (1968) · Proceedings of the April 30--May 2, 1968, spring joint computer conference on - AFIPS '68 (Spring) · doi:10.1145/1468075.1468121 · Cited by 2,417
The Parallel Evaluation of General Arithmetic Expressions
Brent, R. P. (1974) · Journal of the ACM · doi:10.1145/321812.321815 · Cited by 814
Sorting on a mesh-connected parallel computer
Thompson, C. D., & Kung, H. T. (1977) · Communications of the ACM · doi:10.1145/359461.359481 · Cited by 480
Fast Parallel Matrix Inversion Algorithms
Csanky, L. (1976) · SIAM Journal on Computing · doi:10.1137/0205040 · Cited by 397
Cited by
PEGASUS: A Peta-Scale Graph Mining System Implementation and Observations
Kang, U., Tsourakakis, C. E., & Faloutsos, C. (2009) · 2009 Ninth IEEE International Conference on Data Mining · doi:10.1109/icdm.2009.14 · Cited by 628
Scans as primitive parallel operations
Blelloch, G. E. (1989) · IEEE Transactions on Computers · doi:10.1109/12.42122 · Cited by 538
Linear-time connected-component labeling based on sequential local operations
Suzuki, K., Horiba, I., & Sugie, N. (2003) · Computer Vision and Image Understanding · doi:10.1016/s1077-3142(02)00030-9 · Cited by 414
Distribution-free, Risk-controlling Prediction Sets
Bates, S., Angelopoulos, A., Lei, L., Malik, J., & Jordan, M. (2021) · Journal of the ACM · doi:10.1145/3478535 · Cited by 144
“Specifically, consider h : Y → 2Y to be an 8-connectivity connected components function [44].”
Background
Metadata
- Authors
- Hirschberg, D. S., Chandra, A. K., & Sarwate, D. V.
- Venue
- Communications of the ACM
- Published
- 1979-08
- Volume
- 22
- Issue
- 8
- Pages
- 461-464
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2086825382
- Cited by
- 266
- References
- 5
- FWCI
- 6.72
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computing connected components on parallel computers. https://app.cochat.ai/papers/10.1145/359138.359141
- The paper
- Hirschberg, D. S., Chandra, A. K., & Sarwate, D. V. (1979). Computing connected components on parallel computers. Communications of the ACM. https://doi.org/10.1145/359138.359141
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.