Binary bubble languages and cool-lex order
DOI10.1016/J.JCTA.2011.07.005zbMATH Open1314.68205OpenAlexW1997415583MaRDI QIDQ645969FDOQ645969
Authors: 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
Recommendations
algorithmsinterval graphsknapsack problemLyndon wordsexhaustive generationconstant amortized timenecklacesGray codesordered treesDyck words
Permutations, words, matrices (05A05) Combinatorics in computer science (68R05) Other designs, configurations (05B30) Boolean programming (90C09) Cyclic codes (94B15)
Cites Work
- Title not available (Why is that?)
- Generating linear extensions of posets by transpositions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generating Linear Extensions Fast
- Universal cycles for combinatorial structures
- On universal cycles of labeled graphs
- Title not available (Why is that?)
- A Survey of Combinatorial Gray Codes
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- A Gray Code for Necklaces of Fixed Density
- Exhaustive generation of combinatorial objects by ECO
- Title not available (Why is that?)
- Gray codes from antimatroids
- Gray codes for necklaces
- De Bruijn sequences for fixed-weight binary strings
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- Efficient oracles for generating binary bubble languages
- Title not available (Why is that?)
- De Bruijn sequences for the binary strings with maximum density
- Universal Cycles of Discrete Functions
- The coolest way to generate combinations
- Title not available (Why is that?)
- de Bruijn sequences and de Bruijn graphs for a general language
- A loopless algorithm for generating the permutations of a multiset
- A loop-free algorithm for generating the linear extensions of a poset
- Ranking and loopless generation of \(k\)-ary Dyck words in cool-lex order
- Random Generation and Enumeration of Proper Interval Graphs
- Generating Multiset Permutations in Constant Time
- Title not available (Why is that?)
- Computing and Combinatorics
- Loopless generation of linear extensions of a poset
- Gray codes for reflectable languages
Cited In (21)
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- Efficient oracles for generating binary bubble languages
- Cool-lex order and \(k\)-ary Catalan structures
- Bubble-flip -- a new generation algorithm for prefix normal words
- A universal cycle for strings with fixed-content (which are also known as multiset permutations)
- Flip-swap languages in binary reflected Gray code order
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
- Combinatorial generation via permutation languages. I: Fundamentals
- Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
- Constructing the first (and coolest) fixed-content universal cycle
- Traversing combinatorial 0/1-polytopes via optimization
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
- On infinite prefix normal words
- De Bruijn sequences for the binary strings with maximum density
- A shift Gray code for fixed-content Łukasiewicz words
- Successor rules for flipping pancakes and burnt pancakes
- Combinatorial Generation via Permutation Languages. V. Acyclic Orientations
- The coolest way to generate binary strings
- Properties of the cycles that contain all vectors of weight \(\le k\)
- Generating 2-Gray codes for ballot sequences in constant amortized time
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order
This page was built for publication: Binary bubble languages and cool-lex order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645969)
