Graph Traversal
Graph Traversal is a systematic method for exploring the nodes and edges of a graph by visiting each node according to a specific set of rules that distinguish it from other graph exploration techniques.
334
Publications
18.6K
Citations
951
Authors
378
Institutions
Publications per year
2017–2026
89
Parents
334
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
Choice Reviews Online · 2005 · 657 citations
Duane Merrill, Michael Garland, Andrew Grimshaw · 2012 · 512 citations
Fast and sensitive mapping of nanopore sequencing reads with GraphMap
Ivan Sović, Mile Šikić, Andreas Wilm et al. · Nature Communications · 2016 · 430 citations · Full text
1–5 of 334
951
Hong Kong University of Science and Technology, Hong Kong SAR China
5 publications · 235 citations
5
h-index
5
h-index
4
h-index
4
h-index
4
h-index
1–5 of 951
378
Tsinghua University
Beijing, China
8 h-index
27 publications
971 citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
7 h-index
7 publications
313 citations

Tel Aviv University
Tel Aviv, Israel
6 h-index
10 publications
646 citations
National University of Singapore
Singapore, Singapore
6 h-index
10 publications
644 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
6 h-index
10 publications
1K citations

Centre National de la Recherche Scientifique
Paris, France
6 h-index
9 publications
556 citations
Georgia Institute of Technology
Atlanta, United States
6 h-index
13 publications
660 citations
Intel (United States)
Santa Clara, United States
6 h-index
21 publications
1.8K citations
1–8 of 378
PVLDB · 10 publications · 410 citations
10
h-index
Repository · 11 publications · 236 citations
10
h-index
TOG · 7 publications · 393 citations
7
h-index
TKDE · 4 publications · 218 citations
4
h-index
4 publications · 62 citations
4
h-index
1–5