Parallel Depth-first Search

Parallel Depth-First Search is a parallel tree algorithm that explores nodes by advancing along each branch to its deepest level before backtracking, distinguished by the concurrent execution of multiple search threads on distinct segments of the search space to accelerate traversal.

39

Publications

1.4K

Citations

78

Authors

45

Institutions

Publications per year

2017–2026

5

Authors

78

  1. RA
    Richard Anderson

    University of Washington, United States

    4 publications · 165 citations

    4

    h-index

  2. AA
    Alok Aggarwal

    IBM (United States), United States

    3 publications · 155 citations

    3

    h-index

  3. VN
    V. Nageshwara Rao

    The University of Texas at Austin, United States

    3 publications · 362 citations

    3

    h-index

  4. BW
    Benjamin W. Wah

    University of Illinois Urbana-Champaign, United States

    2 publications · 29 citations

    2

    h-index

  5. WD
    Wolfgang Dittrich

    Paderborn University, Germany

    2 publications · 100 citations

    2

    h-index

1–5 of 78

Venues

  1. SIAM Journal on Computing

    3 publications · 137 citations

    3

    h-index

  2. International Journal of Parallel Programming

    2 publications · 344 citations

    2

    h-index

  3. Proceedings of the International Conference on Parallel Processing

    Conference · 2 publications · 30 citations

    2

    h-index

  4. International Joint Conference on Artificial Intelligence

    Conference · 2 publications · 70 citations

    2

    h-index

  5. Information Processing Letters

    1 publications · 23 citations

    1

    h-index

1–5