An algorithm for generating necklaces of beads in two colors (Q1084396)
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: An algorithm for generating necklaces of beads in two colors |
scientific article; zbMATH DE number 3979061
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for generating necklaces of beads in two colors |
scientific article; zbMATH DE number 3979061 |
Statements
An algorithm for generating necklaces of beads in two colors (English)
0 references
1986
0 references
The correspondence among necklaces of beads of length n in two colours, binary cycles from a circulating register of length n and the lexicographic compositions of the integer n is established, and algorithms to generate all necklaces or some specific classes of necklaces are given.
0 references
algorithms
0 references
necklaces
0 references
0.8428733348846436
0 references
0.8319048285484314
0 references
0.8085339069366455
0 references
