A Hamilton cycle in the \(k\)-sided pancake network
From MaRDI portal
Publication:2115848
DOI10.1007/978-3-030-79987-8_10OpenAlexW3183404862MaRDI QIDQ2115848
Aaron Williams, Ben Cameron, Joe Sawada
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/2103.09256
Related Items
Lengths of cycles in generalized pancake graphs, Star transposition Gray codes for multiset permutations, Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality
Cites Work
- 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
- 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
- Binomial Eulerian polynomials for colored permutations
- Fun with algorithms. 7th international conference, FUN 2014, Lipari Island, Sicily, Italy, July 1--3, 2014. Proceedings
- The Greedy Gray Code Algorithm
- A group-theoretic model for symmetric interconnection networks
- On the Diameter of the Pancake Network
- Pattern avoidance in coloured permutations
