A Gray Code for Necklaces of Fixed Density
From MaRDI portal
Recommendations
Cited in
(16)- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- Binary bubble languages and cool-lex order
- Gray-ordered binary necklaces
- More restrictive Gray codes for necklaces and Lyndon words
- A fast algorithm to generate necklaces with fixed content
- Gray codes for necklaces and Lyndon words of arbitrary base
- Necklaces and Lyndon words in colexicographic and binary reflected Gray code order
- Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking
- Ranking and unranking fixed-density necklaces and Lyndon words
- Cyclic compositions and cycles of the hypercube
- Finding the largest fixed-density necklace and Lyndon word
- An Efficient Algorithm for Generating Necklaces with Fixed Density
- Necklaces and slimes
- scientific article; zbMATH DE number 1305469 (Why is no real title available?)
- AN ALGORITHM TO CONSTRUCT THE LE DIAGRAM ASSOCIATED TO A GRASSMANN NECKLACE
- Generating fixed density bracelets of arbitrary base
This page was built for publication: A Gray Code for Necklaces of Fixed Density
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4717574)