Depth-first Search
Depth-First Search is a graph traversal algorithm that explores as far as possible along each branch before backtracking, distinguished from other traversal methods by its systematic prioritization of depth over breadth in visiting nodes.
789
Publications
50.9K
Citations
1.9K
Authors
751
Institutions
Publications per year
2017–2026
143
789
Depth-First Search and Linear Graph Algorithms
Robert E. Tarjan · SIAM Journal on Computing · 1972 · 6K citations
gSpan: graph-based substructure pattern mining
Xifeng Yan, Jiawei Han · 2003 · 2K citations
John E. Hopcroft, Robert E. Tarjan · Journal of the ACM · 1974 · 1.1K citations · Full text
Sequential PAttern mining using a bitmap representation
Jay Ayres, Jason Flannick, Johannes Gehrke et al. · 2002 · 1.1K citations
1–5 of 789
1.9K
13
h-index
9
h-index
5
h-index
5
h-index
5
h-index
1–5 of 1.9K
751
University of California, Los Angeles
Los Angeles, United States
15 h-index
30 publications
1.5K citations

University of Alberta
Edmonton, Canada
11 h-index
20 publications
612 citations
The University of Texas at Austin
Austin, United States
11 h-index
20 publications
814 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
10 h-index
18 publications
819 citations
IBM (United States)
Armonk, United States
10 h-index
13 publications
674 citations
Stanford University
Stanford, United States
10 h-index
17 publications
4.1K citations

Centre National de la Recherche Scientifique
Paris, France
10 h-index
18 publications
516 citations
University of Illinois Urbana-Champaign
Urbana, United States
10 h-index
18 publications
5.6K citations
1–8 of 751
18 publications · 1.1K citations
16
h-index
13 publications · 7K citations
12
h-index
TKDE · 11 publications · 949 citations
11
h-index
Repository · 9 publications · 437 citations
9
h-index
Conference · 9 publications · 353 citations
9
h-index
1–5