Greedy flipping of pancakes and burnt pancakes

DOI10.1016/J.DAM.2016.02.005zbMATH Open1339.05010OpenAlexW2183793754MaRDI QIDQ299051FDOQ299051

Authors: 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

Recommendations

• On the problem of sorting burnt pancakes
• On the Diameter of the Pancake Network
• On average and highest number of flips in pancake sorting

zbMATH Keywords

permutationsgreedy algorithmCayley graphsigned permutationsHamilton cyclesymmetric groupgray codeprefix-reversalsigned symmetric group

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Combinatorics of genome rearrangements.
• Bounds for sorting by prefix reversal
• The greedy Gray code algorithm
• Title not available (Why is that?)
• On the Diameter of the Pancake Network
• A Survey of Combinatorial Gray Codes
• Title not available (Why is that?)
• 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

Cited In (13)

• A Hamilton cycle in the \(k\)-sided pancake network
• On the number of pancake stacks requiring four flips to be sorted
• Traversing combinatorial 0/1-polytopes via optimization
• On average and highest number of flips in pancake sorting
• On the problem of sorting burnt pancakes
• Successor rules for flipping pancakes and burnt pancakes
• Star transposition Gray codes for multiset permutations
• Syntactic view of sigma-tau generation of permutations
• The mathematics of burger flipping
• Rearranging two dimensional arrays by prefix reversals
• Polynomial-time sortable stacks of burnt pancakes
• Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality
• Generating signed permutations by twisting two-sided ribbons

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

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