A Gray code for combinations of a multiset (Q1922877)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Gray code for combinations of a multiset |
scientific article; zbMATH DE number 930074
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Gray code for combinations of a multiset |
scientific article; zbMATH DE number 930074 |
Statements
A Gray code for combinations of a multiset (English)
0 references
30 September 1996
0 references
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.
0 references
Hamiltonian path
0 references
Boolean matrices
0 references
Gray codes
0 references
multiset combinations
0 references
0.8510221838951111
0 references
0.7859699726104736
0 references