Generalized algorithm for restricted weak composition generation
From MaRDI portal
Recommendations
- A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions
- scientific article; zbMATH DE number 2234920
- scientific article; zbMATH DE number 205341
- Fast algorithm for generating ascending compositions
- ECO-generation for some restricted classes of compositions
Cites work
- scientific article; zbMATH DE number 3573250 (Why is no real title available?)
- scientific article; zbMATH DE number 2040940 (Why is no real title available?)
- scientific article; zbMATH DE number 1506516 (Why is no real title available?)
- scientific article; zbMATH DE number 2176112 (Why is no real title available?)
- A Gray code for compositions
- A general exhaustive generation algorithm for Gray structures
- A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions
- Combinatorics of Compositions and Words
- Exhaustive generation of combinatorial objects by ECO
- Gray codes, loopless algorithm and partitions
- Loop-free Gray code algorithms for the set of compositions
- Restricted compositions and permutations: from old to new Gray codes
Cited in
(4)- A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions
- New algorithms and analyses for sum-preserving encryption
- scientific article; zbMATH DE number 205341 (Why is no real title available?)
- scientific article; zbMATH DE number 2234920 (Why is no real title available?)
This page was built for publication: Generalized algorithm for restricted weak composition generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q387319)