Hamiltonicity of k-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality

DOI10.1007/S00453-022-01022-XMaRDI QIDQ2689255zbMATH OpenOpenAlexFDO

Authors Ben Cameron, Joe Sawada, Wei Therese, Aaron Williams

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

zbMATH Keywords

greedy algorithmHamilton cyclecombinatorial generation

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Successor rules for flipping pancakes and burnt pancakes
• Greedy flipping of pancakes and burnt pancakes
• On the Diameter of the Pancake Network
• Cycles in the burnt pancake graph
• Small cycles in the pancake graph

Cites work

• scientific article; zbMATH DE number 3557795 (Why is no real title available?)
• scientific article; zbMATH DE number 706769 (Why is no real title available?)
• scientific article; zbMATH DE number 3189338 (Why is no real title available?)
• A Hamilton cycle in the \(k\)-sided pancake network
• 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
• Combinatorial generation via permutation languages
• Combinatorial generation via permutation languages. I: Fundamentals
• Combinatorics of genome rearrangements.
• Fabian Stedman: The First Group Theorist?
• Fun with algorithms. 5th international conference, FUN 2010, Ischia, Italy, June 2--4, 2010. Proceedings
• Fun with algorithms. 7th international conference, FUN 2014, Lipari Island, Sicily, Italy, July 1--3, 2014. Proceedings
• Generation of Permutations by Adjacent Transposition
• Generation of permutation sequences: Part 2
• 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
• Perfect Snake-in-the-Box Codes for Rank Modulation
• Successor rules for flipping pancakes and burnt pancakes
• Symmetric unimodal expansions of excedances in colored permutations
• The greedy Gray code algorithm
• The spurs of D. H. Lehmer. Hamiltonian paths in neighbor-swap graphs of permutations

Cited in

(3)

• Successor rules for flipping pancakes and burnt pancakes
• Constant time and space updates for the sigma-tau problem
• Generating signed permutations by twisting two-sided ribbons

This page was built for publication: Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2689255)