Generating derangements by interchanging at most four elements
MikawaKenji, SembaIchiro · Systems and Computers in Japan · 2004
For the set S = 1,2,,n, a permutation :S S such that (i)i is called a complete permutation, and the string (1)(2)(n) is called a derangement. In this paper, the authors consider the generation of a...