Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality
From MaRDI portal
Publication:2689255
DOI10.1007/s00453-022-01022-xOpenAlexW4292607711MaRDI QIDQ2689255
Ben Cameron, Aaron Williams, Joe Sawada, Wei Therese
Publication date: 9 March 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-01022-x
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Greedy flipping of pancakes and burnt pancakes
- On the group of alternating colored permutations.
- Minimal overlapping patterns in colored permutations
- A new algorithm for generation of permutations
- Symmetric unimodal expansions of excedances in colored permutations
- Successor rules for flipping pancakes and burnt pancakes
- Fun with algorithms. 5th international conference, FUN 2010, Ischia, Italy, June 2--4, 2010. Proceedings
- Labeled partitions with colored permutations
- Bounds for sorting by prefix reversal
- Longest increasing subsequences of random colored permutations
- Coloured permutations containing and avoiding certain patterns
- On the problem of sorting burnt pancakes
- A Hamilton cycle in the \(k\)-sided pancake network
- Binomial Eulerian polynomials for colored permutations
- The spurs of D. H. Lehmer. Hamiltonian paths in neighbor-swap graphs of permutations
- Fun with algorithms. 7th international conference, FUN 2014, Lipari Island, Sicily, Italy, July 1--3, 2014. Proceedings
- Fabian Stedman: The First Group Theorist?
- The Greedy Gray Code Algorithm
- Perfect Snake-in-the-Box Codes for Rank Modulation
- A group-theoretic model for symmetric interconnection networks
- On the Diameter of the Pancake Network
- Combinatorial generation via permutation languages
- Generation of permutation sequences: Part 2
- Generation of Permutations by Adjacent Transposition
- Combinatorial generation via permutation languages. I. Fundamentals
- Pattern avoidance in coloured permutations
