Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions

DOI10.1016/J.IPL.2011.03.006MaRDI QIDQ1944946zbMATH OpenOpenAlexFDO

Authors Toufik Mansour, Ghalib Nassar, Vincent 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

zbMATH Keywords

combinatorial problemse-restricted growth functionsGray codesloop-free algorithmspartitions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Nonnumerical algorithms (68W05)

Recommendations

• Gray codes, loopless algorithm and partitions
• More restricted growth functions: Gray codes and exhaustive generation
• scientific article; zbMATH DE number 731846
• A Gray code for set partitions
• Loop-free Gray code algorithms for the set of compositions

Cites work

• A loopless algorithm for generating the permutations of a multiset
• Generation of Permutations by Adjacent Transposition
• Gray code for derangements
• Gray code for permutations with a fixed number of cycles
• Gray codes for involutions
• Gray codes, loopless algorithm and partitions
• scientific article; zbMATH DE number 3957110 (Why is no real title available?)
• scientific article; zbMATH DE number 731846 (Why is no real title available?)
• scientific article; zbMATH DE number 2040940 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Loop-free Gray code algorithms for the set of compositions
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• On Rotations and the Generation of Binary Trees
• On the loopless generation of binary tree sequences

Cited in

(6)

• More restricted growth functions: Gray codes and exhaustive generation
• Efficient generation of restricted growth words
• scientific article; zbMATH DE number 731846 (Why is no real title available?)
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
• Difference ascent sequences
• Maximize the rightmost digit: Gray codes for restricted growth strings

This page was built for publication: Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions

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