A Gray code for compositions

DOI10.1016/0196-6774(82)90006-2zbMATH Open0477.68071OpenAlexW1968708670MaRDI QIDQ3933764FDOQ3933764

Authors: Paul Klingsberg 

Publication date: 1982

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(82)90006-2

zbMATH Keywords

rapid algorithmsequential listing of compositions

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Cited In (12)

• A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions
• Loop-free Gray code algorithms for the set of compositions
• Generating all distributions of objects to bins
• Gray codes for reflection groups
• Action-graph games
• Distribution of distinguishable objects to bins: generating all distributions
• Restricted compositions and permutations: from old to new Gray codes
• Design and analysis of stochastic local search for the multiobjective traveling salesman problem
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
• Efficient computation of statistical procedures based on all subsets of a specified size
• An algorithm to compute the \(t\)-value of a digital net and of its projections
• Generalized algorithm for restricted weak composition generation

This page was built for publication: A Gray code for compositions

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