Parallel Graph Traversal
Parallel Graph Traversal is a computational method that enables the simultaneous exploration of multiple nodes or edges in a graph structure across parallel processing units to accelerate path discovery and data aggregation compared to sequential traversal techniques.
123
Publications
5.4K
Citations
332
Authors
148
Institutions
Publications per year
2017–2026
25
Parents
123
Duane Merrill, Michael Garland, Andrew Grimshaw · 2012 · 512 citations
Gunrock: a high-performance graph processing library on the GPU
Yangzihao Wang, Andrew Davidson, Yuechao Pan et al. · 2015 · 305 citations · Full text
Wook-Shin Han, Sangyeon Lee, Kyungyeol Park et al. · 2013 · 263 citations
Work-Efficient Parallel GPU Methods for Single-Source Shortest Paths
Andrew Davidson, Sean Baxter, Michael Garland et al. · 2014 · 189 citations · Full text
1–5 of 123
332
3
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 332
148
University of California, Berkeley
Berkeley, United States
6 h-index
16 publications
507 citations
Max Planck Society
Munich, Germany
4 h-index
7 publications
217 citations
IBM (United States)
Armonk, United States
4 h-index
10 publications
665 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
4 h-index
7 publications
243 citations
Nvidia (United States)
Santa Clara, United States
3 h-index
3 publications
695 citations
Indian Institute of Technology Kharagpur
Kharagpur, India
3 h-index
5 publications
131 citations
University at Buffalo, State University of New York
Buffalo, United States
3 h-index
3 publications
85 citations
Georgia Institute of Technology
Atlanta, United States
3 h-index
5 publications
157 citations
1–8 of 148
4 publications · 82 citations
4
h-index
4 publications · 48 citations
4
h-index
4 publications · 113 citations
4
h-index
3 publications · 89 citations
3
h-index
Conference · 3 publications · 59 citations
3
h-index
1–5