Successor rules for flipping pancakes and burnt pancakes
DOI10.1016/J.TCS.2015.09.007zbMATH Open1332.68091OpenAlexW1886146870MaRDI QIDQ897860FDOQ897860
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
Recommendations
permutationsgreedy algorithmCayley graphHamilton cyclesymmetric groupprefix-reversalpancake sortinghuman problem solvingsigned-permutations
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)
Cites Work
- Title not available (Why is that?)
- A method and two algorithms on the theory of partitions
- Combinatorics of genome rearrangements.
- Greedy flipping of pancakes and burnt pancakes
- On the Diameter of the Pancake Network
- On average and highest number of flips in pancake sorting
- A new algorithm for generation of permutations
- Transforming cabbage into turnip
- De Bruijn sequences for fixed-weight binary strings
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- Efficient oracles for generating binary bubble languages
- Binary bubble languages and cool-lex order
- Shorthand universal cycles for permutations
- On the problem of sorting burnt pancakes
- An explicit universal cycle for the ( n -1)-permutations of an n -set
- An \((18/11)n\) upper bound for sorting by prefix reversals
- The coolest way to generate combinations
- Ranking and unranking permutations in linear time
- Cool-lex order and \(k\)-ary Catalan structures
- Title not available (Why is that?)
- The coolest way to generate binary strings
- Pancake problems with restricted prefix reversals and some corresponding Cayley networks.
- A surprisingly simple de Bruijn sequence construction
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
Uses Software
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)
