Generating signed permutations by twisting two-sided ribbons
From MaRDI portal
Publication:6547921
DOI10.1007/978-3-031-55598-5_8MaRDI QIDQ6547921
Publication date: 31 May 2024
signed permutationscombinatorial generationloopless algorithmsgreedy Gray codesplain changessigned permutohedron
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Greedy flipping of pancakes and burnt pancakes
- A new algorithm for generation of permutations
- Successor rules for flipping pancakes and burnt pancakes
- Shorthand universal cycles for permutations
- Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality
- The Greedy Gray Code Algorithm
- Doubly adjacent gray codes for the symmetric group
- A Survey of Combinatorial Gray Codes
- A loopless implementation of a gray code for signed permutations
- Generation of permutation sequences: part 1
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Generation of Permutations by Adjacent Transposition
- Combinatorial generation via permutation languages. I. Fundamentals
- All your bases are belong to us: listing all bases of a matroid by greedy exchanges
- Constant time and space updates for the sigma-tau problem
This page was built for publication: Generating signed permutations by twisting two-sided ribbons
