Successor rules for flipping pancakes and burnt pancakes

DOI10.1016/J.TCS.2015.09.007MaRDI QIDQ897860zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 8 December 2015

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2015.09.007

zbMATH Keywords

permutationsgreedy algorithmCayley graphHamilton cyclesymmetric groupprefix-reversalpancake sortinghuman problem solvingsigned-permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Eulerian and Hamiltonian graphs (05C45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Recommendations

• Greedy flipping of pancakes and burnt pancakes
• On the problem of sorting burnt pancakes
• Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality

Cites work

• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 7051269 (Why is no real title available?)
• A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
• A method and two algorithms on the theory of partitions
• A new algorithm for generation of permutations
• A surprisingly simple de Bruijn sequence construction
• An (18/11)n upper bound for sorting by prefix reversals
• An explicit universal cycle for the (n-1)-permutations of an n-set
• Binary bubble languages and cool-lex order
• Combinatorics of genome rearrangements.
• Cool-lex order and k-ary Catalan structures
• De Bruijn sequences for fixed-weight binary strings
• Efficient oracles for generating binary bubble languages
• Greedy flipping of pancakes and burnt pancakes
• On average and highest number of flips in pancake sorting
• On the Diameter of the Pancake Network
• On the problem of sorting burnt pancakes
• Pancake problems with restricted prefix reversals and some corresponding Cayley networks.
• Ranking and unranking permutations in linear time
• Shorthand universal cycles for permutations
• The coolest way to generate binary strings
• The coolest way to generate combinations
• Transforming cabbage into turnip

Cited in

(5)

• A Hamilton cycle in the \(k\)-sided pancake network
• Greedy flipping of pancakes and burnt pancakes
• Relative-order abstractions for the pancake problem
• Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality
• Generating signed permutations by twisting two-sided ribbons

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Successor rules for flipping pancakes and burnt pancakes

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