Loop-free Gray code algorithms for the set of compositions

DOI10.1007/S10852-010-9131-3MaRDI QIDQ655198zbMATH OpenOpenAlexFDO

Authors Toufik Mansour, Ghalib Nassar

Publication date 2 January 2012

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-010-9131-3

zbMATH Keywords

Gray codecompositionloopless algorithm

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial codes (94B25)

Recommendations

• Gray codes, loopless algorithm and partitions
• Combinatorial Gray codes for classes of pattern avoiding permutations
• Restricted compositions and permutations: from old to new Gray codes
• Loopless generation of Gray codes for \(k\)-ary trees
• A loopless implementation of a gray code for signed permutations
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
• A Survey of Combinatorial Gray Codes
• Gray code and loopless algorithm for the reflection group \(D_n\)
• Combinatorial Gray codes -- an updated survey

Cites work

• scientific article; zbMATH DE number 1665457 (Why is no real title available?)
• scientific article; zbMATH DE number 731846 (Why is no real title available?)
• scientific article; zbMATH DE number 1506516 (Why is no real title available?)
• scientific article; zbMATH DE number 1522933 (Why is no real title available?)
• A Gray code for compositions
• A loopless algorithm for generating the permutations of a multiset
• Combinatorics of Compositions and Words
• Generating Multiset Permutations in Constant Time
• Generating permutations of a bag by interchanges
• Generating permutations with given ups and downs
• Generation of Permutations by Adjacent Transposition
• Gray code for derangements
• Gray codes, loopless algorithm and partitions
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Loopless Generation of Trees with Specified Degrees
• On the loopless generation of binary tree sequences

Cited in

(17)

• \(m\)-compositions and \(m\)-partitions: exhaustive generation and Gray code
• Algorithms – ESA 2005
• A general exhaustive generation algorithm for Gray structures
• Gray codes, loopless algorithm and partitions
• Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions
• scientific article; zbMATH DE number 1933234 (Why is no real title available?)
• Loopless Gray code enumeration and the Tower of Bucharest
• Loopless Gray code enumeration and the Tower of Bucharest
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
• Approximate Quadrature Measures on Data-Defined Spaces
• scientific article; zbMATH DE number 844138 (Why is no real title available?)
• Loopless generation of Gray codes for \(k\)-ary trees
• A Gray code for set partitions
• A loopless implementation of a gray code for signed permutations
• scientific article; zbMATH DE number 1506516 (Why is no real title available?)
• Generalized algorithm for restricted weak composition generation
• Combinatorial families that are exponentially far from being listable in Gray code sequence

This page was built for publication: Loop-free Gray code algorithms for the set of compositions

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