Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions
From MaRDI portal
Publication:1944946
DOI10.1016/j.ipl.2011.03.006zbMath1260.68448OpenAlexW2087998687MaRDI QIDQ1944946
Ghalib Nassar, Toufik Mansour, Vicentiu Vajnovszki
Publication date: 28 March 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.03.006
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Nonnumerical algorithms (68W05)
Related Items
Efficient generation of restricted growth words, Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
Cites Work
- On the loopless generation of binary tree sequences
- Loop-free Gray code algorithms for the set of compositions
- Gray code for permutations with a fixed number of cycles
- Gray codes, loopless algorithm and partitions
- Gray code for derangements
- A loopless algorithm for generating the permutations of a multiset
- On Rotations and the Generation of Binary Trees
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Generation of Permutations by Adjacent Transposition
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item