Generalized algorithm for restricted weak composition generation

DOI10.1007/s10852-012-9194-4zbMath1286.68367OpenAlexW33092544MaRDI QIDQ387319

Daniel R. Page

Publication date: 20 December 2013

Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-012-9194-4

zbMATH Keywords

combinatoricsenumerationinteger compositionsrestricted compositionsenumeration algorithmscomputational number theorygeneralized algorithmsgeneralized compositionsgeneration algorithmsrestricted weak compositionsweak integer compositions

Mathematics Subject Classification ID

General topics of discrete mathematics in relation to computer science (68R01) Combinatorics in computer science (68R05)

Related Items

New algorithms and analyses for sum-preserving encryption

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions
• Loop-free Gray code algorithms for the set of compositions
• A general exhaustive generation algorithm for Gray structures
• Gray codes, loopless algorithm and partitions
• Exhaustive generation of combinatorial objects by ECO
• Restricted compositions and permutations: from old to new Gray codes
• A Gray code for compositions
• Combinatorics of Compositions and Words