Greedy flipping of pancakes and burnt pancakes

DOI10.1016/j.dam.2016.02.005zbMath1339.05010OpenAlexW2183793754MaRDI QIDQ299051

Joe Sawada, Aaron Williams

Publication date: 22 June 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.02.005

zbMATH Keywords

permutationsCayley graphgreedy algorithmsymmetric groupHamilton cyclesigned permutationsgray codeprefix-reversalsigned symmetric group

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45) Symmetric groups (20B30)

Related Items (5)

Star transposition Gray codes for multiset permutations ⋮ Successor rules for flipping pancakes and burnt pancakes ⋮ Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality ⋮ Syntactic view of sigma-tau generation of permutations ⋮ A Hamilton cycle in the \(k\)-sided pancake network

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pancake flipping is hard
• On average and highest number of flips in pancake sorting
• A new algorithm for generation of permutations
• Successor rules for flipping pancakes and burnt pancakes
• Bounds for sorting by prefix reversal
• The Greedy Gray Code Algorithm
• On the Diameter of the Pancake Network
• A Survey of Combinatorial Gray Codes

This page was built for publication: Greedy flipping of pancakes and burnt pancakes