An algorithm for generating necklaces of beads in two colors
Discrete Mathematics
Journal of Algorithms
A Gray Code for Necklaces of Fixed Density
SIAM Journal on Discrete Mathematics
An Efficient Algorithm for Generating Necklaces with Fixed Density
SIAM Journal on Computing
Discrete Mathematics
The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions
The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions
The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming)
The Art of Computer Programming, Volume 4, Fascicle 4: Generating All Trees--History of Combinatorial Generation (Art of Computer Programming)
More restrictive Gray codes for necklaces and Lyndon words
Information Processing Letters
Binary bubble languages and cool-lex order
Journal of Combinatorial Theory Series A
| Hi-index | 5.23 |
This paper develops a constant amortized time algorithm to produce a cyclic cool-lex Gray code for fixed-density binary necklaces, Lyndon words, and pseudo-necklaces. It is the first Gray code for these objects that achieves this time bound. The algorithm is applied: (i) to develop a constant amortized time cyclic Gray code for necklaces, Lyndon words, and pseudo-necklaces ordered by density and (ii) to obtain a fixed-density de Bruijn sequence using constant time per n bits on average. In addition to Gray code order, the algorithms can be easily modified to output the strings in co-lex order.