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
Parents
42
Backtrack programming techniques
J. Bitner, Edward M. Reingold · Communications of the ACM · 1975 · 323 citations · Full text
Enumeration of the Elementary Circuits of a Directed Graph
Robert E. Tarjan · SIAM Journal on Computing · 1973 · 260 citations
Static determination of dynamic properties of recursive procedures
Patrick Cousot, Radhia Cousot · 1977 · 178 citations
1–5 of 42
88
2
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 88
57

University of Science and Technology Beijing
Beijing, China
2 h-index
4 publications
46 citations

University of Alberta
Edmonton, Canada
2 h-index
3 publications
331 citations
The University of Texas at Austin
Austin, United States
2 h-index
4 publications
54 citations

Atlanta University Center
Atlanta, United States
1 h-index
1 publications
24 citations

Obuda University
Budapest, Hungary
1 h-index
1 publications
90 citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
1 h-index
2 publications
32 citations

The University of Sydney
Sydney, Australia
1 h-index
1 publications
31 citations

Santa Fe Institute
Santa Fe, United States
1 h-index
1 publications
11 citations
1–8 of 57
3 publications · 86 citations
3
h-index
2 publications · 159 citations
2
h-index
JCD · 2 publications · 58 citations
2
h-index
2 publications · 274 citations
2
h-index
2 publications · 397 citations
2
h-index
1–5