Graph Traversal Algorithms
Graph Traversal Algorithms is a systematic computational method for exploring vertices and edges in a graph by visiting each vertex according to a specific order or strategy, distinguishing it from other graph analysis techniques by its focus on the procedural visitation and examination of graph elements.
385
Publications
30.5K
Citations
1K
Authors
427
Institutions
Publications per year
2017–2026
81
Variants
Graph Search Algorithms
385
Depth-First Search and Linear Graph Algorithms
Robert E. Tarjan · SIAM Journal on Computing · 1972 · 6K citations
Exponential algorithmic speedup by a quantum walk
Andrew M. Childs, Richard Cleve, E. Deotto et al. · 2003 · 831 citations · Full text
Computing, Computer Science, Physics +13
Depth-first search and linear graph algorithms
Robert E. Tarjan · 1971 · 655 citations
1–5 of 385
1K
7
h-index
4
h-index
4
h-index
4
h-index
Hong Kong University of Science and Technology, Hong Kong SAR China
4 publications · 216 citations
4
h-index
1–5 of 1K
427
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
8 h-index
14 publications
1.1K citations

Tel Aviv University
Tel Aviv, Israel
8 h-index
12 publications
774 citations
Tsinghua University
Beijing, China
7 h-index
24 publications
835 citations
IBM (United States)
Armonk, United States
7 h-index
11 publications
936 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
6 h-index
9 publications
677 citations
Intel (United States)
Santa Clara, United States
6 h-index
21 publications
1.8K citations
National University of Singapore
Singapore, Singapore
6 h-index
10 publications
644 citations

University of Waterloo
Waterloo, Canada
6 h-index
8 publications
422 citations
1–8 of 427
10 publications · 7.8K citations
10
h-index
10 publications · 412 citations
10
h-index
PVLDB · 10 publications · 464 citations
10
h-index
9 publications · 220 citations
9
h-index
7 publications · 768 citations
7
h-index
1–5