A Hamilton cycle in the k-sided pancake network
From MaRDI portal
Publication:2115848
DOI10.1007/978-3-030-79987-8_10OpenAlexW3183404862MaRDI QIDQ2115848FDOQ2115848
Aaron Williams, Ben Cameron, Joe Sawada
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/2103.09256
Cites Work
- A group-theoretic model for symmetric interconnection networks
- Title not available (Why is that?)
- Bounds for sorting by prefix reversal
- The Greedy Gray Code Algorithm
- Greedy flipping of pancakes and burnt pancakes
- Title not available (Why is that?)
- On the Diameter of the Pancake Network
- A new algorithm for generation of permutations
- Successor rules for flipping pancakes and burnt pancakes
- Symmetric unimodal expansions of excedances in colored permutations
- Fun with algorithms. 7th international conference, FUN 2014, Lipari Island, Sicily, Italy, July 1--3, 2014. Proceedings
- Coloured permutations containing and avoiding certain patterns
- Pattern avoidance in coloured permutations
- Minimal overlapping patterns in colored permutations
- On the problem of sorting burnt pancakes
- On the group of alternating colored permutations.
- Longest increasing subsequences of random colored permutations
- Binomial Eulerian polynomials for colored permutations
- Labeled partitions with colored permutations
Cited In (5)
- A Hamilton Cycle in the $k$-Sided Pancake Network
- Traversing combinatorial 0/1-polytopes via optimization
- 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
This page was built for publication: A Hamilton cycle in the \(k\)-sided pancake network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115848)
