The DOI matches its Crossref record.
Depth-First Search and Linear Graph Algorithms
Abstract
The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and at algorithm for finding the biconnected components of an undirect graph are presented. The space and time requirements of both algorithms are bounded by $k_1 V + k_2 E + k_3 $ for some constants $k_1 ,k_2 $, and $k_3 $, 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
No references could be resolved yet.
Research works printed but not linked: 9
- 10.1145/364063.364082 · doi:10.1145/364063.364082
- 10.1145/321296.321300 · DOI · Paper page
- 10.21236/AD0705364 · DOI · Paper page
- 10.1016/0020-0190(71)90019-6 · doi:10.1016/0020-0190(71)90019-6
- Hopcroft J. E., 1972, Complexity of computer computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N. Y., 1972)
- Munro I., 1971, Efficient determination of the strongly connected components and transitive closure of a directed graph
- Nilson N. J., 1971, Problem Solving Methods in Artificial Intelligence
- 10.1145/362619.362628 · doi:10.1145/362619.362628
- R. W. Shirey, Masters Thesis, Implementation and analysis of efficient graph planarity testing algorithms, Doctoral thesis, Computer Sciences Department, University of Wisconsin, Madison, 1969
Cited by
The Joint Graphical Lasso for Inverse Covariance Estimation Across Multiple Classes
Danaher, P., Wang, P., & Witten, D. M. (2014) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12033 · Cited by 855
Variation graph toolkit improves read mapping by representing genetic variation in the reference
Garrison, E., Sirén, J., Novak, A. M., Hickey, G., Eizenga, J. M., Dawson, E. T., Jones, W., Garg, S., Markello, C., Lin, M. F., et al. (2018) · Nature Biotechnology · doi:10.1038/nbt.4227 · Cited by 821
Automatic translation of FORTRAN programs to vector form
Allen, R., & Kennedy, K. (1987) · ACM Transactions on Programming Languages and Systems · doi:10.1145/29873.29875 · Cited by 734
Projections from neocortex mediate top-down control of memory retrieval
Rajasethupathy, P., Sankaran, S., Marshel, J. H., Kim, C. K., Ferenczi, E., Lee, S. Y., Berndt, A., Ramakrishnan, C., Jaffe, A., Lo, M., et al. (2015) · Nature · doi:10.1038/nature15389 · Cited by 509
MSMBuilder2: Modeling Conformational Dynamics on the Picosecond to Millisecond Scale
Beauchamp, K. A., Bowman, G. R., Lane, T. J., Maibaum, L., Haque, I. S., & Pande, V. S. (2011) · Journal of Chemical Theory and Computation · doi:10.1021/ct200463m · Cited by 372
Metadata
- Authors
- Tarjan, R.
- Venue
- SIAM Journal on Computing
- Published
- 1972-06
- Volume
- 1
- Issue
- 2
- Pages
- 146-160
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2118382442
- Cited by
- 6,081
- References
- 0
- FWCI
- 30.09
- Type
- journal article
- 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.1137/0201010
- The paper
- Tarjan, R. (1972). Depth-First Search and Linear Graph Algorithms. SIAM Journal on Computing. https://doi.org/10.1137/0201010
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.
