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
619
Depth-First Search and Linear Graph Algorithms
Robert E. Tarjan · SIAM Journal on Computing · 1972 · 6K citations
Algorithms for constraint-satisfaction problems: a survey
Vipin Kumar · 1992 · 891 citations
1–5 of 619
1.2K
Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento, Portugal
10 publications · 1.6K citations
10
h-index
8
h-index
7
h-index
7
h-index
7
h-index
1–5 of 1.2K
532

Centre National de la Recherche Scientifique
Paris, France
13 h-index
30 publications
1.2K citations

University of Waterloo
Waterloo, Canada
12 h-index
21 publications
1.4K citations

University of Alberta
Edmonton, Canada
12 h-index
16 publications
1.1K citations

Huazhong University of Science and Technology
Wuhan, China
11 h-index
39 publications
3.2K citations
University of Michigan
Ann Arbor, United States
10 h-index
15 publications
2.5K citations
Carnegie Mellon University
Pittsburgh, United States
9 h-index
12 publications
1.5K citations
The University of Texas at Austin
Austin, United States
9 h-index
15 publications
430 citations
Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento
Lisbon, Portugal
9 h-index
16 publications
2K citations
1–8 of 532
18 publications · 2.4K citations
17
h-index
Repository · 13 publications · 516 citations
12
h-index
11 publications · 6.7K citations
11
h-index
Conference · 10 publications · 490 citations
10
h-index
JAIR · 9 publications · 762 citations
9
h-index
1–5