A Gray code for combinations of a multiset

DOI10.1006/EUJC.1996.0043MaRDI QIDQ1922877zbMATH OpenOpenAlexFDO

Authors Frank Ruskey, Carla D. Savage

Publication date 30 September 1996

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/fa80ce6d853ffe05577b14282cdd81160eba5cd7

zbMATH Keywords

Boolean matricesGray codesHamiltonian pathmultiset combinations

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Other types of codes (94B60)

Review text

Minimal change listings of combinatorial objects are called Gray codes, after Frank Gray, who patented a scheme for listing \(n\)-bit strings so that successive strings differ in just one bit. In this paper, it has been shown that multiset combinations can be listed so that successive combinations differ by one element. The paper concludes with three open problems.

Recommendations

• A Survey of Combinatorial Gray Codes
• Combinatorial families that are exponentially far from being listable in Gray code sequence
• scientific article; zbMATH DE number 731846
• The greedy Gray code algorithm
• Gray codes and overlap cycles for restricted weight words

Cited in

(6)

• Enumerating submultisets of multisets
• The greedy Gray code algorithm
• A Survey of Combinatorial Gray Codes
• Computing and Combinatorics
• Combinatorial Gray codes -- an updated survey
• Degree reduction techniques for polynomial optimization problems

This page was built for publication: A Gray code for combinations of a multiset

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