A new algorithm for generating derangements

DOI10.1007/BF01933579zbMath0432.68048OpenAlexW2020449815MaRDI QIDQ3870323

Selim G. Akl

Publication date: 1980

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01933579

zbMATH Keywords

permutationscombinatoricsanalysis of algorithmsgenerating derangements

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Related Items

The Feller coupling for random derangements ⋮ Efficient generation of random derangements with the expected distribution of cycle lengths ⋮ On generation of permutations through decomposition of symmetric groups into cosets ⋮ More restrictive Gray codes for some classes of pattern avoiding permutations ⋮ A CAT algorithm for generating permutations with a fixed number of inversions ⋮ A parallel derangement generation algorithm ⋮ Gray code for derangements

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient generation of the binary reflected gray code and its applications
• Generating Trees and Other Combinatorial Objects Lexicographically
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations