Parallel Backtracking
Parallel Backtracking is a parallel algorithmic strategy within the class of backtracking methods, distinguished by the concurrent exploration of multiple branches of a search tree to accelerate the solution of combinatorial problems.
30
Publications
1K
Citations
69
Authors
24
Institutions
Publications per year
2017–2026
1
Parents
30
1–5 of 30
69
4
h-index
Institut national de recherche en sciences et technologies du numérique, France
2 publications · 96 citations
2
h-index
Cincinnati Children's Hospital Medical Center, United States
2 publications · 57 citations
2
h-index
2
h-index
2
h-index
1–5 of 69
24
University of California, Berkeley
Berkeley, United States
3 h-index
4 publications
446 citations

University of Minnesota
Minneapolis, United States
3 h-index
4 publications
206 citations
Universidad Nacional Autónoma de México
Mexico City, Mexico
2 h-index
4 publications
72 citations

University of Cincinnati
Cincinnati, United States
2 h-index
4 publications
114 citations
Iowa State University
Ames, United States
1 h-index
2 publications
24 citations
University of Mons
Mons, Belgium
1 h-index
2 publications
34 citations
IBM (United States)
Armonk, United States
1 h-index
1 publications
16 citations

Eastern Washington University
Cheney, United States
1 h-index
1 publications
11 citations
1–8 of 24
3 publications · 146 citations
3
h-index
1 publications · 11 citations
1
h-index
Conference · 1 publications · 22 citations
1
h-index
JCD · 1 publications · 16 citations
1
h-index
1 publications · 20 citations
1
h-index
1–5