A Gray code for compositions
From MaRDI portal
Publication:3933764
DOI10.1016/0196-6774(82)90006-2zbMath0477.68071MaRDI QIDQ3933764
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
68R99: Discrete mathematics in relation to computer science
Related Items
Efficient computation of statistical procedures based on all subsets of a specified size, Distribution of distinguishable objects to bins: generating all distributions, Generalized algorithm for restricted weak composition generation, Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions, Action-graph games, A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions, Loop-free Gray code algorithms for the set of compositions, Design and analysis of stochastic local search for the multiobjective traveling salesman problem, Gray codes for reflection groups, Restricted compositions and permutations: from old to new Gray codes, An algorithm to compute the \(t\)-value of a digital net and of its projections, Generating all distributions of objects to bins