Loop-free Gray code algorithms for the set of compositions
From MaRDI portal
Publication:655198
DOI10.1007/s10852-010-9131-3zbMath1248.94122OpenAlexW2048343828MaRDI QIDQ655198
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
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial codes (94B25)
Related Items (3)
Generalized algorithm for restricted weak composition generation ⋮ Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions ⋮ Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the loopless generation of binary tree sequences
- Gray codes, loopless algorithm and partitions
- 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
- A Gray code for compositions
- Generating Multiset Permutations in Constant Time
- Loopless Generation of Trees with Specified Degrees
- Combinatorics of Compositions and Words
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Generation of Permutations by Adjacent Transposition
This page was built for publication: Loop-free Gray code algorithms for the set of compositions