A Gray code for compositions

DOI10.1016/0196-6774(82)90006-2zbMath0477.68071OpenAlexW1968708670MaRDI QIDQ3933764

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)

Related Items

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