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
Anderson, C. A., Boucher, G., Lees, C. W., Franke, A., D'Amato, M., Taylor, K. D., Lee, J. C., Goyette, P., Imielinski, M., Latiano, A., et al. (2011) · Nature Genetics · doi:10.1038/ng.764 · Cited by 1,320
(2006) · Technical Report Series 936 · doi:10.2471/trs.02.935 · Cited by 1,096
Hopcroft, J., & Tarjan, R. (1974) · Journal of the ACM · doi:10.1145/321850.321852 · Cited by 1,081
Self-citationDESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
Clarke, E. M., & Emerson, E. A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-69850-0_12 · Cited by 1,070
A graph‐theory algorithm for rapid protein side‐chain prediction
Canutescu, A. A., Shelenkov, A. A., & Dunbrack, R. L. (2003) · Protein Science · doi:10.1110/ps.03154503 · Cited by 997
Gprof: A call graph execution profiler
Graham, S. L., Kessler, P. B., & Mckusick, M. K. (1982) · Proceedings of the 1982 SIGPLAN symposium on Compiler construction - SIGPLAN '82 · doi:10.1145/800230.806987 · Cited by 971
(1998) · Choice Reviews Online · doi:10.5860/choice.35-6287 · Cited by 904
A linear-time algorithm for testing the truth of certain quantified boolean formulas
Aspvall, B., Plass, M. F., & Tarjan, R. E. (1979) · Information Processing Letters · doi:10.1016/0020-0190(79)90002-4 · Cited by 892
Self-citationPrinciples of Constraint Programming
Apt, K. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511615320 · Cited by 888
Software pipelining: an effective scheduling technique for VLIW machines
Lam, M. S. (2004) · ACM SIGPLAN Notices · doi:10.1145/989393.989420 · Cited by 884
Interactive control of avatars animated with human motion data
Lee, J., Chai, J., Reitsma, P. S. A., Hodgins, J. K., & Pollard, N. S. (2002) · Proceedings of the 29th annual conference on Computer graphics and interactive techniques · doi:10.1145/566570.566607 · Cited by 864
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
Model-checking algorithms for continuous-time markov chains
Baier, C., Haverkort, B., Hermanns, H., & Katoen, J.-P. (2003) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2003.1205180 · Cited by 767
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
The Transitive Reduction of a Directed Graph
Aho, A. V., Garey, M. R., & Ullman, J. D. (1972) · SIAM Journal on Computing · doi:10.1137/0201008 · Cited by 718
A fast algorithm for finding dominators in a flowgraph
Lengauer, T., & Tarjan, R. E. (1979) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357062.357071 · Cited by 645
Self-citationSoftware pipelining: an effective scheduling technique for VLIW machines
Lam, M. (1988) · Proceedings of the ACM SIGPLAN 1988 conference on Programming language design and implementation · doi:10.1145/53990.54022 · Cited by 641
Kwiatkowska, M., Norman, G., & Parker, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72522-0_6 · Cited by 590
Quantitative methods for ecological network analysis
Ulanowicz, R. E. (2004) · Computational Biology and Chemistry · doi:10.1016/j.compbiolchem.2004.09.001 · Cited by 573
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
Morrison, D. R., Jacobson, S. H., Sauppe, J. J., & Sewell, E. C. (2016) · Discrete Optimization · doi:10.1016/j.disopt.2016.01.005 · Cited by 563
Multi-View Clustering and Semi-Supervised Classification with Adaptive Neighbours
Nie, F., Cai, G., & Li, X. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10909 · Cited by 557
Anomaly detection of web-based attacks
Kruegel, C., & Vigna, G. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948144 · Cited by 551
Multiview Consensus Graph Clustering
Zhan, K., Nie, F., Wang, J., & Yang, Y. (2019) · IEEE Transactions on Image Processing · doi:10.1109/tip.2018.2877335 · Cited by 545
Graph Learning for Multiview Clustering
Zhan, K., Zhang, C., Guan, J., & Wang, J. (2018) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2751646 · Cited by 543
Spinach – A software library for simulation of spin dynamics in large spin systems
Hogben, H. J., Krzystyniak, M., Charnock, G. T. P., Hore, P. J., & Kuprov, I. (2011) · Journal of Magnetic Resonance · doi:10.1016/j.jmr.2010.11.008 · Cited by 532
Pruned-enriched Rosenbluth method: Simulations ofθpolymers of chain length up to 1 000 000
Grassberger, P. (1997) · Physical Review E · doi:10.1103/physreve.56.3682 · Cited by 528
Algorithmics of Matching Under Preferences
Manlove, D. F. (2013) · Series on Theoretical Computer Science · doi:10.1142/8591 · Cited by 515
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
The node-deletion problem for hereditary properties is NP-complete
Lewis, J. M., & Yannakakis, M. (1980) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(80)90060-4 · Cited by 513
Interactive control of avatars animated with human motion data
Lee, J., Chai, J., Reitsma, P. S. A., Hodgins, J. K., & Pollard, N. S. (2002) · ACM Transactions on Graphics · doi:10.1145/566654.566607 · Cited by 467
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
The theory of joins in relational databases
Aho, A. V., Beeri, C., & Ullman, J. D. (1979) · ACM Transactions on Database Systems · doi:10.1145/320083.320091 · Cited by 423
Auto-Weighted Multi-View Learning for Image Clustering and Semi-Supervised Classification
Nie, F., Cai, G., Li, J., & Li, X. (2018) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2754939 · Cited by 406
Theta and Alpha Oscillations Are Traveling Waves in the Human Neocortex
Zhang, H., Watrous, A. J., Patel, A., & Jacobs, J. (2018) · Neuron · doi:10.1016/j.neuron.2018.05.019 · Cited by 378
Implementation of logical query languages for databases
Ullman, J. D. (1985) · ACM Transactions on Database Systems · doi:10.1145/3979.3980 · Cited by 373
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
Tarjan, R. E. (1977) · Networks · doi:10.1002/net.3230070103 · Cited by 365
Self-citationAlgorithm 907: KLU, A Direct Sparse Solver for Circuit Simulation Problems
Davis, T. A., & Palamadai Natarajan, E. (2010) · ACM Transactions on Mathematical Software · doi:10.1145/1824801.1824814 · Cited by 337
Design Structure Matrix Extensions and Innovations: A Survey and New Opportunities
Browning, T. R. (2016) · IEEE Transactions on Engineering Management · doi:10.1109/tem.2015.2491283 · Cited by 337
Wen, G., Duan, Z., Yu, W., & Chen, G. (2013) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.2779 · Cited by 334
Dynamic scheduling of network updates
Jin, X., Liu, H. H., Gandhi, R., Kandula, S., Mahajan, R., Zhang, M., Rexford, J., & Wattenhofer, R. (2014) · Proceedings of the 2014 ACM conference on SIGCOMM · doi:10.1145/2619239.2626307 · Cited by 329
Conflict-driven answer set solving: From theory to practice
Gebser, M., Kaufmann, B., & Schaub, T. (2012) · Artificial Intelligence · doi:10.1016/j.artint.2012.04.001 · Cited by 327
Eswaran, K. P., & Tarjan, R. E. (1976) · SIAM Journal on Computing · doi:10.1137/0205044 · Cited by 313
Self-citationCyclic pattern kernels for predictive graph mining
Horváth, T., Gärtner, T., & Wrobel, S. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014072 · Cited by 308
Åkesson, J., Årzén, K.-E., Gäfvert, M., Bergdahl, T., & Tummescheit, H. (2010) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2009.11.011 · Cited by 304
Ultra-fast sequence clustering from similarity networks with SiLiX
Miele, V., Penel, S., & Duret, L. (2011) · BMC Bioinformatics · doi:10.1186/1471-2105-12-116 · Cited by 303
On consistent updates in software defined networks
Mahajan, R., & Wattenhofer, R. (2013) · Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks · doi:10.1145/2535771.2535791 · Cited by 301
Detecting Coherent Groups in Crowd Scenes by Multiview Clustering
Wang, Q., Chen, M., Nie, F., & Li, X. (2020) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2875002 · Cited by 299
Yang, Y., Liu, Y., Zhou, M., Li, F., & Sun, C. (2015) · Safety Science · doi:10.1016/j.ssci.2015.06.006 · Cited by 298
Gprof: A call graph execution profiler
Graham, S. L., Kessler, P. B., & Mckusick, M. K. (1982) · ACM SIGPLAN Notices · doi:10.1145/872726.806987 · Cited by 297
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
Sparsification—a technique for speeding up dynamic graph algorithms
Eppstein, D., Galil, Z., Italiano, G. F., & Nissenzweig, A. (1997) · Journal of the ACM · doi:10.1145/265910.265914 · Cited by 282
Reasoning about qualitative temporal information
van Beek, P. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90011-l · Cited by 276
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
Efficient chaotic iteration strategies with widenings
Bourdoncle, F. (2006) · Lecture Notes in Computer Science · doi:10.1007/bfb0039704 · Cited by 275
Automatic Thread Extraction with Decoupled Software Pipelining
Ottoni, G., Rangan, R., Stoler, A., & August, D. I. (2006) · 38th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO'05) · doi:10.1109/micro.2005.13 · Cited by 273
ASK-GraphView: A Large Scale Graph Visualization System
Abello, J., van Ham, F., & Krishnan, N. (2006) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2006.120 · Cited by 272
A survey of powertrain configuration studies on hybrid electric vehicles
Zhuang, W., Li (Eben), S., Zhang, X., Kum, D., Song, Z., Yin, G., & Ju, F. (2020) · Applied Energy · doi:10.1016/j.apenergy.2020.114553 · Cited by 263
A survey of sparse matrix research
Duff, I. S. (1977) · Proceedings of the IEEE · doi:10.1109/proc.1977.10514 · Cited by 262
Wen, G., Yu, W., Hu, G., Cao, J., & Yu, X. (2015) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2015.2443064 · Cited by 261
Schulte-Sasse, R., Budach, S., Hnisz, D., & Marsico, A. (2021) · Nature Machine Intelligence · doi:10.1038/s42256-021-00325-y · Cited by 256
A multi-model approach to the detection of web-based attacks
Kruegel, C., Vigna, G., & Robertson, W. (2005) · Computer Networks · doi:10.1016/j.comnet.2005.01.009 · Cited by 255
Semiring Frameworks and Algorithms for Shortest-Distance Problems
Mohri, M. (2002) · doi:10.25596/jalc-2002-321 · Cited by 254
A New Subspace Clustering Strategy for AI-Based Data Analysis in IoT System
Cui, Z., Jing, X., Zhao, P., Zhang, W., & Chen, J. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3056578 · Cited by 254
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
Estimating interlock and improving balance for pipelined architectures
Callahan, D., Cocke, J., & Kennedy, K. (1988) · Journal of Parallel and Distributed Computing · doi:10.1016/0743-7315(88)90002-0 · Cited by 152
EMMA: A Software Package for Markov Model Building and Analysis
Senne, M., Trendelkamp-Schroer, B., Mey, A. S. J. S., Schütte, C., & Noé, F. (2012) · Journal of Chemical Theory and Computation · doi:10.1021/ct300274u · Cited by 148
Network Statistics of the Whole-Brain Connectome of Drosophila
Lin, A., Yang, R., Dorkenwald, S., Matsliah, A., Sterling, A. R., Schlegel, P., Yu, S.-C., McKellar, C. E., Costa, M., Eichler, K., et al. (2023) · doi:10.1101/2023.07.29.551086 · Cited by 147
Network statistics of the whole-brain connectome of Drosophila
Lin, A., Yang, R., Dorkenwald, S., Matsliah, A., Sterling, A. R., Schlegel, P., Yu, S.-C., McKellar, C. E., Costa, M., Eichler, K., et al. (2024) · Nature · doi:10.1038/s41586-024-07968-y · Cited by 147
“All neurons within an SCC are mutually reach- 129 able via directed pathways (39).”
How well-connected is the surface of the global ocean?
Froyland, G., Stuart, R. M., & van Sebille, E. (2014) · Chaos: An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4892530 · Cited by 131
Autocatalytic networks in biology: structural theory and algorithms
Steel, M., Hordijk, W., & Xavier, J. C. (2019) · Journal of The Royal Society Interface · doi:10.1098/rsif.2018.0808 · Cited by 68
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
Folding kinetics and unfolded state dynamics of the GB1 hairpin from molecular simulation
De Sancho, D., Mittal, J., & Best, R. B. (2013) · Journal of Chemical Theory and Computation · doi:10.1021/ct301033r · Cited by 35
(2011) · The Electronic Journal of e-Learning · Cited by 24
Astroturfing as a strategy for manipulating public opinion on Twitter during the pandemic in Spain
Arce-García, S., Said-Hung, E., & Mottareale, D. (2022) · El Profesional de la información · doi:10.3145/epi.2022.may.10 · Cited by 17
Disrupting networks of hate: characterising hateful networks and removing critical nodes
Alorainy, W., Burnap, P., Liu, H., Williams, M., & Giommoni, L. (2022) · Social Network Analysis and Mining · doi:10.1007/s13278-021-00818-z · Cited by 15
Structural motif search across the protein universe with Folddisco
Kim, H., Kim, R. S., Mirdita, M., Yoon, J., & Steinegger, M. (2026) · Nature Biotechnology · doi:10.1038/s41587-026-03162-9 · Cited by 10
LaForge: Always-Correct and Fast Incremental Builds from Simple Specifications
Curtsinger, C., & Barowy, D. W. (2021) · arXiv
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.