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
39
1–5 of 39
78
4
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 78
45
IBM (United States)
Armonk, United States
3 h-index
3 publications
155 citations
The University of Texas at Austin
Austin, United States
3 h-index
5 publications
398 citations

Paderborn University
Paderborn, Germany
2 h-index
5 publications
277 citations
University of Washington
Seattle, United States
2 h-index
2 publications
104 citations

James Cook University
Townsville, Australia
1 h-index
1 publications
11 citations
University of Alabama
Tuscaloosa, United States
1 h-index
1 publications
14 citations
Taichung Veterans General Hospital
Taichung, Taiwan
1 h-index
1 publications
10 citations
Indiana University Bloomington
Bloomington, United States
1 h-index
1 publications
33 citations
1–8 of 45
3 publications · 137 citations
3
h-index
2 publications · 344 citations
2
h-index
Conference · 2 publications · 30 citations
2
h-index
Conference · 2 publications · 70 citations
2
h-index
1 publications · 23 citations
1
h-index
1–5