The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Depth-first search and linear graph algorithms
Abstract
The value of depth-first search or "backtracking" as a technique for solving graph problems is illustrated by two examples. An algorithm for finding the biconnected components of an undirected graph and an improved version of an algorithm for finding the strongly connected components of a directed graph are presented. The space and time requirements of both algorithms are bounded by k1V + k2E + k3 for some constants k1, k2, and k3, where V is the number of vertices and E is the number of edges of the graph being examined.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Department of Computer Science
(1993) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(93)90083-n · Cited by 1,210
Golomb, S. W., & Baumert, L. D. (1965) · Journal of the ACM · doi:10.1145/321296.321300 · Cited by 498
Efficient algorithms for graph manipulation
Hopcroft, J. E., & Tarjan, R. E. (1971) · Cited by 231
Self-citationA transitive closure algorithm
Purdom, P. W. (1970) · BIT Numerical Mathematics · doi:10.1007/bf01940892 · Cited by 114
Cited by
Direct Methods for Sparse Matrices
Duff, I. S., Erisman, A. M., & Reid, J. K. (2017) · doi:10.1093/acprof:oso/9780198508380.001.0001 · Cited by 1,604
Node-and edge-deletion NP-complete problems
Yannakakis, M. (1978) · Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 · doi:10.1145/800133.804355 · Cited by 435
Gomes, C., Thule, C., Broman, D., Larsen, P. G., & Vangheluwe, H. (2019) · ACM Computing Surveys · doi:10.1145/3179993 · Cited by 369
Zeng, J., Cao, L., Xu, M., Zhu, T., & Zhang, J. Z. H. (2020) · Nature Communications · doi:10.1038/s41467-020-19497-z · Cited by 288
Quantitative analysis of population-scale family trees with millions of relatives
Kaplanis, J., Gordon, A., Shor, T., Weissbrod, O., Geiger, D., Wahl, M., Gershovits, M., Markus, B., Sheikh, M., Gymrek, M., et al. (2018) · Science · doi:10.1126/science.aam9309 · Cited by 245
Metadata
- Authors
- Tarjan, R.
- Venue
- 12th Annual Symposium on Switching and Automata Theory (swat 1971)
- Publisher
- IEEE
- Published
- 1971-10
- Pages
- 114-121
- ISSN
- 0272-4847 (ISSN-L)
- OpenAlex
- W2534652523
- Cited by
- 647
- References
- 6
- FWCI
- 1.33
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Depth-first search and linear graph algorithms. https://app.cochat.ai/papers/10.1109/swat.1971.10
- The paper
- Tarjan, R. (1971). Depth-first search and linear graph algorithms. 12th Annual Symposium on Switching and Automata Theory (swat 1971). https://doi.org/10.1109/swat.1971.10
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.