Pages that link to "Item:Q1897357"
From MaRDI portal
The following pages link to On the problem of sorting burnt pancakes (Q1897357):
Displaying 32 items.
- Greedy flipping of pancakes and burnt pancakes (Q299051) (← links)
- A quadratic lower bound for topswops (Q410720) (← links)
- Pancake flipping is hard (Q494050) (← links)
- Approximation algorithms for sorting by length-weighted prefix and suffix operations (Q500990) (← links)
- Polynomial-time sortable stacks of burnt pancakes (Q627167) (← links)
- On average and highest number of flips in pancake sorting (Q627182) (← links)
- Girth of pancake graphs (Q642997) (← links)
- Sorting permutations and binary strings by length-weighted rearrangements (Q683752) (← links)
- Fault-tolerant routing in burnt pancake graphs (Q765472) (← links)
- An \((18/11)n\) upper bound for sorting by prefix reversals (Q838149) (← links)
- Successor rules for flipping pancakes and burnt pancakes (Q897860) (← links)
- Some problems on Cayley graphs (Q952069) (← links)
- Vertex reconstruction in Cayley graphs (Q1011492) (← links)
- Rearranging two dimensional arrays by prefix reversals (Q1675161) (← links)
- Cycles in the burnt pancake graph (Q2009003) (← links)
- A Hamilton cycle in the \(k\)-sided pancake network (Q2115848) (← links)
- Fault tolerance and diagnosability of burnt pancake networks under the comparison model (Q2342670) (← links)
- The spectral gap of graphs arising from substring reversals (Q2363694) (← links)
- The (conditional) matching preclusion for burnt pancake graphs (Q2446329) (← links)
- Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults (Q2449066) (← links)
- Short proofs for cut-and-paste sorting of permutations (Q2461214) (← links)
- (Prefix) reversal distance for (signed) strings with few blocks or small alphabets (Q2628806) (← links)
- Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality (Q2689255) (← links)
- An audit tool for genome rearrangement algorithms (Q2828184) (← links)
- On the Diameter of the Pancake Network (Q4366875) (← links)
- Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search (Q4589262) (← links)
- On the Complexity of the Pancake Problem (Q4921438) (← links)
- On the flip graphs on perfect matchings of complete graphs and signed reversal graphs (Q5026994) (← links)
- Groupoid Action and Rearrangement Problem of Bicolor Arrays by Prefix Reversals (Q5042264) (← links)
- Some relations on prefix reversal generators of the symmetric and hyperoctahedral group (Q5109076) (← links)
- Cyclic Vertex (Edge) Connectivity of Burnt Pancake Graphs (Q6135726) (← links)
- The structure fault tolerance of burnt pancake networks (Q6611504) (← links)
