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

Authors

69

  1. HS
    Hans–Paul Schwefel

    TU Dortmund University, Germany

    4 publications · 144 citations

    4

    h-index

  2. MS
    Marc Schoenauer

    Institut national de recherche en sciences et technologies du numérique, France

    2 publications · 96 citations

    2

    h-index

  3. MK
    Michal Kouril

    Cincinnati Children's Hospital Medical Center, United States

    2 publications · 57 citations

    2

    h-index

  4. JL
    Jerome L. Paul

    University of Cincinnati, United States

    2 publications · 57 citations

    2

    h-index

  5. AR
    Abhiram Ranade

    University of California, Berkeley, United States

    2 publications · 96 citations

    2

    h-index

1–5 of 69

Venues

  1. SLP

    3 publications · 146 citations

    3

    h-index

  2. ACM SIGCSE Bulletin

    1 publications · 11 citations

    1

    h-index

  3. Proceedings of the International Conference on Parallel Processing

    Conference · 1 publications · 22 citations

    1

    h-index

  4. Journal of Combinatorial Designs

    JCD · 1 publications · 16 citations

    1

    h-index

  5. Ars Mathematica Contemporanea

    1 publications · 20 citations

    1

    h-index

1–5