Pages that link to "Item:Q5863047"
From MaRDI portal
The following pages link to Combinatorial generation via permutation languages. I. Fundamentals (Q5863047):
Displaying 11 items.
- Generating all permutations by context-free grammars in Chomsky normal form (Q2368945) (← links)
- Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality (Q2689255) (← links)
- ON A HIERARCHY OF PERMUTATION LANGUAGES (Q4922680) (← links)
- Combinatorial generation via permutation languages (Q5146846) (← links)
- Counting and Generating Permutations Using Timed Languages (Q5405068) (← links)
- Combinatorial generation via permutation languages. III: Rectangulations (Q6156087) (← links)
- Combinatorial Generation via Permutation Languages. V. Acyclic Orientations (Q6170445) (← links)
- Generating signed permutations by twisting two-sided ribbons (Q6547921) (← links)
- On the hardness of Gray code problems for combinatorial objects (Q6575387) (← links)
- Traversing combinatorial 0/1-polytopes via optimization (Q6602241) (← links)
- Combinatorial generation via permutation languages. VI: Binary trees (Q6612300) (← links)