Pages that link to "Item:Q5146846"
From MaRDI portal
The following pages link to Combinatorial generation via permutation languages (Q5146846):
Displaying 15 items.
- Generating Gray codes for weak orders in constant amortized time (Q785788) (← links)
- Combinatorial generation via permutation languages. II. Lattice congruences (Q2055278) (← links)
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order (Q2140470) (← links)
- Generating all permutations by context-free grammars in Chomsky normal form (Q2368945) (← links)
- Flip-swap languages in binary reflected Gray code order (Q2676472) (← links)
- Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality (Q2689255) (← links)
- A pivot Gray code listing for the spanning trees of the fan graph (Q2695273) (← links)
- Generative languages, codes and parallel processing (Q4283002) (← links)
- ON A HIERARCHY OF PERMUTATION LANGUAGES (Q4922680) (← links)
- Counting and Generating Permutations Using Timed Languages (Q5405068) (← links)
- Combinatorial generation via permutation languages. I. Fundamentals (Q5863047) (← links)
- Syntactic view of sigma-tau generation of permutations (Q5918363) (← links)
- Combinatorial generation via permutation languages. III: Rectangulations (Q6156087) (← links)
- Combinatorial Generation via Permutation Languages. V. Acyclic Orientations (Q6170445) (← links)
- Pivot Gray codes for the spanning trees of a graph ft. the fan (Q6580496) (← links)