Loop-free Gray code algorithms for the set of compositions
The topic of Gray codes for the set of compositions with non-negative integer parts has been studied by several authors. Klingsberg gave a non-recursive description of a Gray code for this set after the recursive version of Knuth. Recently, Walsh modified Klingsberg's algorithm to find a Gray code which generates the set of all bounded compositions with non-negative integer parts. In this paper, the authors present two loopless Gray code algorithms for the set of compositions with positive integer parts. Each composition is obtained from its predecessor by either incrementing one part by 1 and decrementing another part by 1, or substracting \(i\) from a part and inserting \(i\) to the right of the composition. In an appendix the authors present their algorithms in C++.
- 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
- 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
- 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?)
- 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
- Gray codes, loopless algorithm and partitions
- A Gray code for set partitions
- Loopless generation of Gray codes for \(k\)-ary trees
- Loopless Gray code enumeration and the Tower of Bucharest
- Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions
- m-compositions and m-partitions: exhaustive generation and Gray code
- Generalized algorithm for restricted weak composition generation
- Combinatorial families that are exponentially far from being listable in Gray code sequence
- scientific article; zbMATH DE number 1933234 (Why is no real title available?)
- scientific article; zbMATH DE number 1506516 (Why is no real title available?)
- Approximate Quadrature Measures on Data-Defined Spaces
- scientific article; zbMATH DE number 844138 (Why is no real title available?)
- A loopless implementation of a gray code for signed permutations
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
- Loopless Gray code enumeration and the Tower of Bucharest
- Algorithms – ESA 2005
- A general exhaustive generation algorithm for Gray structures
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)
