Gray codes, loopless algorithm and partitions

DOI10.1007/s10852-008-9086-9zbMath1180.68296MaRDI QIDQ1040787

Toufik Mansour, Ghalib Nassar

Publication date: 25 November 2009

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-008-9086-9

zbMATH Keywords

loopless algorithm; combinatorial algorithm; combinatorial Gray code; generating partitions

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

68W05: Nonnumerical algorithms

05A17: Combinatorial aspects of partitions of integers

05A05: Permutations, words, matrices

94B15: Cyclic codes

Related Items

Generalized algorithm for restricted weak composition generation, Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions, Loop-free Gray code algorithms for the set of compositions, Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gray code for permutations with a fixed number of cycles
• Generating permutations with given ups and downs
• Generating permutations of a bag by interchanges
• Gray code for derangements
• A loopless algorithm for generating the permutations of a multiset
• On \(abab\)-free and \(abba\)-free set partitions
• Generating Multiset Permutations in Constant Time
• Loopless Generation of Trees with Specified Degrees
• Adjacent interchange generation of combinations
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Generation of Permutations by Adjacent Transposition