The following pages link to The Greedy Gray Code Algorithm (Q2842188):
Displaying 20 items.
- Greedy flipping of pancakes and burnt pancakes (Q299051) (← links)
- Independent even cycles in the pancake graph and greedy prefix-reversal Gray codes (Q343754) (← links)
- Greedy codes (Q690025) (← links)
- Greedy cycles in the star graphs (Q1669899) (← links)
- A Gray code for combinations of a multiset (Q1922877) (← links)
- A Hamilton cycle in the \(k\)-sided pancake network (Q2115848) (← links)
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order (Q2140470) (← 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)
- Combinatorial generation via permutation languages. I. Fundamentals (Q5863047) (← links)
- Star transposition Gray codes for multiset permutations (Q6074576) (← links)
- Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← 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)
- Pivot Gray codes for the spanning trees of a graph ft. the fan (Q6580496) (← links)
- Greedy Gray codes for Dyck words and ballot sequences (Q6591618) (← links)
- Traversing combinatorial 0/1-polytopes via optimization (Q6602241) (← links)
- Combinatorial generation via permutation languages. VI: Binary trees (Q6612300) (← links)
