A new algorithm for generating derangements

DOI10.1007/BF01933579MaRDI QIDQ3870323zbMATH OpenOpenAlexFDO

Authors 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

analysis of algorithmscombinatoricsgenerating derangementspermutations

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Cites work

• Efficient generation of the binary reflected gray code and its applications
• Generating Trees and Other Combinatorial Objects Lexicographically
• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• scientific article; zbMATH DE number 3557795 (Why is no real title available?)
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

Cited in

(7)

• A CAT algorithm for generating permutations with a fixed number of inversions
• A parallel derangement generation algorithm
• Gray code for derangements
• 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

This page was built for publication: A new algorithm for generating derangements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3870323)