Recursive Backtracking

Recursive Backtracking is a systematic problem-solving method within backtracking algorithms that employs recursive function calls to explore all feasible solutions by incrementally building candidates and backtracking upon constraint violation.

42

Publications

3.2K

Citations

88

Authors

57

Institutions

Publications per year

2017–2026

7

Authors

88

  1. GK
    Grzegorz Kondrak

    University of Alberta, Canada

    2 publications · 187 citations

    2

    h-index

  2. TS
    T. Seidensticker

    Karlsruhe Institute of Technology, Germany

    2 publications · 151 citations

    2

    h-index

  3. TL
    Tieke Li

    University of Science and Technology Beijing, China

    1 publications · 12 citations

    1

    h-index

  4. PW
    Paul W. Purdom

    Indiana University Bloomington, United States

    1 publications · 14 citations

    1

    h-index

  5. MZ
    Mingxue Zhang

    Chinese University of Hong Kong, Hong Kong SAR China

    1 publications · 19 citations

    1

    h-index

1–5 of 88

Venues

  1. SLP

    3 publications · 86 citations

    3

    h-index

  2. Artificial Intelligence

    2 publications · 159 citations

    2

    h-index

  3. Journal of Combinatorial Designs

    JCD · 2 publications · 58 citations

    2

    h-index

  4. SIAM Journal on Computing

    2 publications · 274 citations

    2

    h-index

  5. Communications of the ACM

    2 publications · 397 citations

    2

    h-index

1–5