A Gray code for set partitions (Q1239129)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3557656
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Gray code for set partitions |
scientific article; zbMATH DE number 3557656 |
Statements
A Gray code for set partitions (English)
0 references
1976
0 references
A Gray code for the set of partitions of \(\{1,\ldots,n\}\) is an ordered list of the partitions with the property that any partition is obtained from its predecessor by moving one letter. The author gives two constructions for such a Gray code, one recursive, the other direct. An algorithm for the second construction is given; it has the property that the average work per partition is bounded independent of \(n\).
0 references
0.9062235355377196
0 references
0.8976534605026245
0 references
0.877496600151062
0 references
0.8722752332687378
0 references
