Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
From MaRDI portal
Publication:6052708
DOI10.1016/j.tcs.2023.114175arXiv2309.01556OpenAlexW4386516458MaRDI QIDQ6052708
Publication date: 17 October 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2309.01556
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- Prefix partitioned Gray codes for particular cross-bifix-free sets
- Binary bubble languages and cool-lex order
- A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words
- More restrictive Gray codes for necklaces and Lyndon words
- Survey on path and cycle embedding in some networks
- Hamilton cycles and paths in vertex-transitive graphs-current directions
- An algorithm for generating subsets of fixed size with a strong minimal change property
- Data compression and Gray-code sorting
- Gray codes in graphs of subsets
- Universal cycles for combinatorial structures
- A Gray code for set partitions
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Transducers and the decidability of independence in free monoids
- Gray visiting Motzkins
- Distances between languages and reflexivity of relations
- Gray code for derangements
- A loopless algorithm for generating the permutations of a multiset
- Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
- Variable-length codes independent or closed with respect to edit relations
- Gray cycles of maximum length related to \(k\)-character substitutions
- Gray codes for Fibonacci \(q\)-decreasing words
- The complexity of change
- On Generating the N-ary Reflected Gray Codes
- Combinatorial Gray Codes
- Updating the hamiltonian problem—A survey
- Generating necklaces
- A Survey of Combinatorial Gray Codes
- ECO:a methodology for the enumeration of combinatorial objects
- A survey on Hamiltonicity in Cayley graphs and digraphs on different groups
- Affine m-ary gray codes
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- When variable-length codes meet the field of error detection
- Combinatorial Gray codes -- an updated survey
This page was built for publication: Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
