Permutation Generation is a backtracking algorithmic technique that systematically constructs all possible arrangements of a set of elements by recursively exploring each candidate extension of partial permutations and retracting upon exhaustion or constraint violation.
168
Publications
6.3K
Citations
281
Authors
169
Institutions
Publications per year
2017–2026
20
Parents
Publications
168
1–5 of 168
Authors
281
- FR
9
h-index
- AW
6
h-index
- JB
3
h-index
- LC
3
h-index
- IS
3
h-index
1–5 of 281
Institutions
169
University of Victoria
Victoria, Canada
10 h-index
15 publications
425 citations
University of California San Diego
San Diego, United States
4 h-index
8 publications
206 citations
Princeton University
Princeton, United States
4 h-index
8 publications
484 citations
University of Florida
Gainesville, United States
4 h-index
5 publications
217 citations
University of Ottawa
Ottawa, Canada
3 h-index
5 publications
72 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
4 publications
267 citations
Indian Institute of Technology Kharagpur
Kharagpur, India
2 h-index
2 publications
37 citations
Harvard University
Cambridge, United States
2 h-index
2 publications
39 citations
1–8 of 169
Venues
- The Computer Journal
14 publications · 368 citations
12
h-index
- The Electronic Journal of Combinatorics
7 publications · 149 citations
7
h-index
- BIT Numerical Mathematics
6 publications · 154 citations
6
h-index
- Information Processing Letters
6 publications · 207 citations
6
h-index
- SIAM Journal on Computing
4 publications · 108 citations
4
h-index
1–5