Backtracking Algorithms

Backtracking Algorithms is a systematic algorithmic technique that belongs to the class of problem-solving methods based on depth-first search, distinguished by its use of recursive exploration with partial solutions that are incrementally built and abandoned upon detecting infeasibility.

619

Publications

48.8K

Citations

1.2K

Authors

532

Institutions

Publications per year

2017–2026

106

Authors

1.2K

  1. JM
    João Marques‐Silva

    Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento, Portugal

    10 publications · 1.6K citations

    10

    h-index

  2. PW
    Paul W. Purdom

    Indiana University Bloomington, United States

    8 publications · 436 citations

    8

    h-index

  3. FB
    Fahiem Bacchus

    University of Toronto, Canada

    7 publications · 430 citations

    7

    h-index

  4. AK
    Apu Kumar Saha

    National Institute of Technology Agartala, India

    7 publications · 287 citations

    7

    h-index

  5. SN
    Sukanta Nama

    National Institute of Technology Agartala, India

    7 publications · 287 citations

    7

    h-index

1–5 of 1.2K

Venues

  1. Artificial Intelligence

    18 publications · 2.4K citations

    17

    h-index

  2. arXiv (Cornell University)

    Repository · 13 publications · 516 citations

    12

    h-index

  3. SIAM Journal on Computing

    11 publications · 6.7K citations

    11

    h-index

  4. International Joint Conference on Artificial Intelligence

    Conference · 10 publications · 490 citations

    10

    h-index

  5. Journal of Artificial Intelligence Research

    JAIR · 9 publications · 762 citations

    9

    h-index

1–5