Binary bubble languages and cool-lex order
From MaRDI portal
Publication:645969
DOI10.1016/j.jcta.2011.07.005zbMath1314.68205MaRDI QIDQ645969
Frank Ruskey, Joe Sawada, Aaron Williams
Publication date: 11 November 2011
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2011.07.005
algorithms; knapsack problem; interval graphs; ordered trees; Lyndon words; exhaustive generation; necklaces; constant amortized time; Gray codes; Dyck words
68R05: Combinatorics in computer science
05A05: Permutations, words, matrices
05B30: Other designs, configurations
90C09: Boolean programming
94B15: Cyclic codes
Related Items
Bubble-flip -- a new generation algorithm for prefix normal words, A Gray code for fixed-density necklaces and Lyndon words in constant amortized time, The coolest way to generate binary strings, Successor rules for flipping pancakes and burnt pancakes, Cool-lex order and \(k\)-ary Catalan structures, Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles, De Bruijn Sequences for the Binary Strings with Maximum Density
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- Efficient oracles for generating binary bubble languages
- Loopless generation of linear extensions of a poset
- Gray codes for reflectable languages
- de Bruijn sequences and de Bruijn graphs for a general language
- The coolest way to generate combinations
- Universal cycles for combinatorial structures
- Gray codes from antimatroids
- Gray codes for necklaces
- A loopless algorithm for generating the permutations of a multiset
- Exhaustive generation of combinatorial objects by ECO
- A loop-free algorithm for generating the linear extensions of a poset
- Generating linear extensions of posets by transpositions
- On universal cycles of labeled graphs
- De Bruijn Sequences for Fixed-Weight Binary Strings
- De Bruijn Sequences for the Binary Strings with Maximum Density
- Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order
- Random Generation and Enumeration of Proper Interval Graphs
- Universal Cycles of Discrete Functions
- Generating Linear Extensions Fast
- Generating Multiset Permutations in Constant Time
- A Survey of Combinatorial Gray Codes
- A Gray Code for Necklaces of Fixed Density
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Computing and Combinatorics
