The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Algorithm 447: efficient algorithms for graph manipulation
Open accessAbstract
Efficient algorithms are presented for partitioning a graph into connected components, biconnected components and simple paths. The algorithm for partitioning of a graph into simple paths of iterative and each iteration produces a new path between two vertices already on paths. (The start vertex can be specified dynamically.) If V is the number of vertices and E is the number of edges, each algorithm requires time and space proportional to max ( V, E ) when executed on a random access computer.
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
Harary, F. (1969) · Cited by 10,739
Harary, F. (1969) · doi:10.21236/ad0705364 · Cited by 4,861
Cited by
Network-based statistic: identifying differences in brain networks
Zalesky, A., Fornito, A., & Bullmore, E. T. (2010) · NeuroImage · doi:10.1016/j.neuroimage.2010.06.041 · Cited by 2,750
“This can be achieved in a runtime of O(N + L) using a breadth-first search (Hopcroft & Tarjan, 1973), where N is the number of nodes and L is the number of suprathreshold links.”
MethodA Separator Theorem for Planar Graphs
Lipton, R. J., & Tarjan, R. E. (1979) · SIAM Journal on Applied Mathematics · doi:10.1137/0136016 · Cited by 1,359
Self-citationProteinortho: Detection of (Co-)orthologs in large-scale analysis
Lechner, M., Findeiß, S., Steiner, L., Marz, M., Stadler, P. F., & Prohaska, S. J. (2011) · BMC Bioinformatics · doi:10.1186/1471-2105-12-124 · Cited by 1,221
Hopcroft, J., & Tarjan, R. (1974) · Journal of the ACM · doi:10.1145/321850.321852 · Cited by 1,081
Self-citationSocial Media Mining: An Introduction
Zafarani, R., Abbasi, M. A., & Liu, H. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139088510 · Cited by 592
A general approach to connected-component labeling for arbitrary image representations
Dillencourt, M. B., Samet, H., & Tamminen, M. (1992) · Journal of the ACM · doi:10.1145/128749.128750 · Cited by 512
Near-Online Multi-target Tracking with Aggregated Local Flow Descriptor
Choi, W. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.347 · Cited by 396
Community Detection and Mining in Social Media
Tang, L., & Liu, H. (2010) · Synthesis lectures on data mining and knowledge discovery · doi:10.2200/s00298ed1v01y201009dmk003 · Cited by 352
DG2: A Faster and More Accurate Differential Grouping for Large-Scale Black-Box Optimization
Omidvar, M. N., Yang, M., Mei, Y., Li, X., & Yao, X. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2694221 · Cited by 347
Hu, Y., Boyd-Graber, J., Satinoff, B., & Smith, A. (2014) · Machine Learning · doi:10.1007/s10994-013-5413-0 · Cited by 338
Eswaran, K. P., & Tarjan, R. E. (1976) · SIAM Journal on Computing · doi:10.1137/0205044 · Cited by 313
Self-citationGlobal Data Flow Analysis and Iterative Algorithms
Kam, J. B., & Ullman, J. D. (1976) · Journal of the ACM · doi:10.1145/321921.321938 · Cited by 304
Detecting Critical Nodes in Interdependent Power Networks for Vulnerability Assessment
Nguyen, D. T., Shen, Y., & Thai, M. T. (2013) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2012.2229398 · Cited by 279
Distributed covering by ant-robots using evaporating traces
Wagner, I. A., Lindenbaum, M., & Bruckstein, A. M. (1999) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.795795 · Cited by 275
Almost-linear time decoding algorithm for topological codes
Delfosse, N., & Nickerson, N. H. (2021) · Quantum · doi:10.22331/q-2021-12-02-595 · Cited by 242
Ecological subsystems via graph theory: the role of strongly connected components
Allesina, S., Bodini, A., & Bondavalli, C. (2005) · Oikos · doi:10.1111/j.0030-1299.2005.13082.x · Cited by 71
VID: Human identification through vein patterns captured from commodity depth cameras
Shah, S. W., Kanhere, S. S., Zhang, J., & Yao, L. (2021) · IET Biometrics · doi:10.1049/bme2.12009 · Cited by 5
“For this purpose, VID leverages the Connected Components (CC) algorithm [32].”
BackgroundMethod
Metadata
- Authors
- Hopcroft, J., & Tarjan, R.
- Venue
- Communications of the ACM
- Published
- 1973-06
- Volume
- 16
- Issue
- 6
- Pages
- 372-378
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2002055996
- Cited by
- 985
- References
- 2
- FWCI
- 12.03
- 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
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.