A Gray Code for Necklaces of Fixed Density
From MaRDI portal
Publication:4717574
DOI10.1137/S089548019528143XzbMath0866.05036MaRDI QIDQ4717574
Terry Min Yih Wang, Carla D. Savage
Publication date: 8 July 1997
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s089548019528143x
68R05: Combinatorics in computer science
05A05: Permutations, words, matrices
68R10: Graph theory (including graph drawing) in computer science
05C45: Eulerian and Hamiltonian graphs
Related Items
Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking, A Gray code for fixed-density necklaces and Lyndon words in constant amortized time, Binary bubble languages and cool-lex order, More restrictive Gray codes for necklaces and Lyndon words, A fast algorithm to generate necklaces with fixed content, Cyclic compositions and cycles of the hypercube, Necklaces and Lyndon words in colexicographic and binary reflected Gray code order, Ranking and unranking fixed-density necklaces and Lyndon words, Finding the largest fixed-density necklace and Lyndon word