Polynomial-time sortable stacks of burnt pancakes

DOI10.1016/j.tcs.2010.11.004zbMath1209.68174arXiv1010.0219OpenAlexW2038291323MaRDI QIDQ627167

Josef Cibulka, Anthony Labarre

Publication date: 21 February 2011

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

Full work available at URL: https://arxiv.org/abs/1010.0219

zbMATH Keywords

permutationsalgorithmssortingcombinatorial problemsinterconnection networks

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05)

Related Items

Position and content paradigms in genome rearrangements: the wild and crazy world of permutations in genomics, Sorting by prefix block-interchanges, Sorting genomes by prefix double-cut-and-joins, Unnamed Item, The distribution of cycles in breakpoint graphs of signed permutations, Pancake flipping is hard, Fault tolerance and diagnosability of burnt pancake networks under the comparison model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Advances on sorting by reversals
• Bounds for sorting by prefix reversal
• A very elementary presentation of the Hannenhalli-Pevzner theory
• On the problem of sorting burnt pancakes
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• Combinatorics of Coxeter Groups
• Transforming cabbage into turnip
• Edit Distances and Factorisations of Even Permutations
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• Genome Rearrangements and Sorting by Reversals
• Combinatorial Pattern Matching
• Algorithms – ESA 2005