A Gray code for compositions

DOI10.1016/0196-6774(82)90006-2MaRDI QIDQ3933764zbMATH OpenOpenAlexFDO

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

(13)

• 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
• Generalized algorithm for restricted weak composition generation
• Efficient computation of statistical procedures based on all subsets of a specified size
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
• Distribution of distinguishable objects to bins: generating all distributions
• 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
• Spin-s U(1)-Eigenstate preparation

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)