A Hamilton cycle in the k-sided pancake network

DOI10.1007/978-3-030-79987-8_10MaRDI QIDQ2115848zbMATH OpenOpenAlexFDO

Authors Ben Cameron, Joe Sawada, Aaron Williams

Publication date 22 March 2022

Full work available at URL https://arxiv.org/abs/2103.09256

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites work

• scientific article; zbMATH DE number 3557795 (Why is no real title available?)
• A group-theoretic model for symmetric interconnection networks
• A new algorithm for generation of permutations
• Binomial Eulerian polynomials for colored permutations
• Bounds for sorting by prefix reversal
• Coloured permutations containing and avoiding certain patterns
• Combinatorics of genome rearrangements.
• Fun with algorithms. 7th international conference, FUN 2014, Lipari Island, Sicily, Italy, July 1--3, 2014. Proceedings
• Greedy flipping of pancakes and burnt pancakes
• Labeled partitions with colored permutations
• Longest increasing subsequences of random colored permutations
• Minimal overlapping patterns in colored permutations
• On the Diameter of the Pancake Network
• On the group of alternating colored permutations.
• On the problem of sorting burnt pancakes
• Pattern avoidance in coloured permutations
• Successor rules for flipping pancakes and burnt pancakes
• Symmetric unimodal expansions of excedances in colored permutations
• The greedy Gray code algorithm

Cited in

(5)

• Star transposition Gray codes for multiset permutations
• A Hamilton Cycle in the $k$-Sided Pancake Network
• Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality
• Traversing combinatorial 0/1-polytopes via optimization
• Lengths of cycles in generalized pancake graphs

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)