Skipping ropes: an efficient gray code algorithm for generating wiggly permutations
From MaRDI portal
Cites work
- A book proof of the middle levels theorem
- A loop-free two-close Gray-code algorithm for listing k-ary Dyck words
- All your bases are belong to us: listing all bases of a matroid by greedy exchanges
- An Eades-McKay algorithm for well-formed parentheses strings
- Associahedra for finite‐type cluster algebras and minimal relations between g‐vectors
- Associahedra via spines
- Catalan Numbers
- Celebrating Loday's associahedron
- Combinatorial generation via permutation languages. I: Fundamentals
- Combinatorial generation via permutation languages. III: Rectangulations
- Combinatorial generation via permutation languages. VI: Binary trees
- Combinatorial generation: greedy approaches and symmetry
- Combinatorial Gray codes -- an updated survey
- Combinatorial Gray codes for classes of pattern avoiding permutations
- Constant time and space updates for the sigma-tau problem
- Cool-lex order and k-ary Catalan structures
- Finite Coxeter groups and the weak order
- Generating binary trees by transpositions
- Generating Binary Trees Lexicographically
- Generating Multiset Permutations in Constant Time
- Generating signed permutations by twisting two-sided ribbons
- Generating Trees and Other Combinatorial Objects Lexicographically
- Generation of Permutations by Adjacent Transposition
- Hamilton cycles in restricted and incomplete rotator graphs
- Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- scientific article; zbMATH DE number 54194 (Why is no real title available?)
- scientific article; zbMATH DE number 3557795 (Why is no real title available?)
- scientific article; zbMATH DE number 1265079 (Why is no real title available?)
- scientific article; zbMATH DE number 7051269 (Why is no real title available?)
- scientific article; zbMATH DE number 2176112 (Why is no real title available?)
- Lattice congruences of the weak order.
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Monoïdes préordonnés et chaînes de Malcev
- On Rotations and the Generation of Binary Trees
- One hundred problems in elementary mathematics. With a foreword by Martin Gardner
- Permutohedra, Associahedra, and Beyond
- Pop \& Push: ordered tree iteration in \(\mathcal{O}(1)\)-time
- Proof of the middle levels conjecture
- Shorthand universal cycles for permutations
- Solving the sigma-tau problem
- Successor rules for flipping pancakes and burnt pancakes
- The \(s\)-weak order and \(s\)-permutahedra. I: Combinatorics and lattice structure
- The coolest way to generate combinations
- The greedy Gray code algorithm
- Wigglyhedra
This page was built for publication: Skipping ropes: an efficient gray code algorithm for generating wiggly permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312598)
