Gray codes, loopless algorithm and partitions

DOI10.1007/s10852-008-9086-9zbMath1180.68296OpenAlexW2081454722MaRDI 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 algorithmcombinatorial algorithmcombinatorial Gray codegenerating partitions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Nonnumerical algorithms (68W05) Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05) Cyclic codes (94B15)

Related Items

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

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