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

Authors

332

  1. MG
    Michael Garland

    University of Illinois Urbana-Champaign, United States

    3 publications · 842 citations

    3

    h-index

  2. UM
    Ulrich Meyer

    Goethe University Frankfurt, Germany

    3 publications · 105 citations

    3

    h-index

  3. WH
    Wook-Shin Han

    Pohang University of Science and Technology, South Korea

    3 publications · 360 citations

    3

    h-index

  4. AD
    Andrew Davidson

    University of California, Davis, United States

    3 publications · 564 citations

    3

    h-index

  5. JC
    Jike Chong

    University of California, Berkeley, United States

    3 publications · 101 citations

    3

    h-index

1–5 of 332

Venues

  1. BIT Numerical Mathematics

    4 publications · 82 citations

    4

    h-index

  2. Parallel Computing

    4 publications · 48 citations

    4

    h-index

  3. Journal of Algorithms

    4 publications · 113 citations

    4

    h-index

  4. Information Processing Letters

    3 publications · 89 citations

    3

    h-index

  5. Proceedings of the International Conference on Parallel Processing

    Conference · 3 publications · 59 citations

    3

    h-index

1–5