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 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
Harary, F. (1969) · Cited by 10,739
Harary, F. (1969) · doi:10.21236/ad0705364 · Cited by 4,861
Problem-Solving Methods in Artificial Intelligence
Nilsson, N. J. (1971) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,607
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
Research works printed but not linked: 6
- 10.1145/364063.364082 · doi:10.1145/364063.364082
- 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
- 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
Holzmann, G. J. (1997) · IEEE Transactions on Software Engineering · doi:10.1109/32.588521 · Cited by 3,803
Design and synthesis of synchronization skeletons using branching time temporal logic
Clarke, E. M., & Emerson, E. A. (2005) · Lecture Notes in Computer Science · doi:10.1007/bfb0025774 · Cited by 2,219
Detecting community structure in networks
Newman, M. E. J. (2004) · The European Physical Journal B - Condensed Matter · doi:10.1140/epjb/e2004-00124-y · Cited by 2,028
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
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
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
- 6
- 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
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.