Pages that link to "Item:Q1253928"
From MaRDI portal
The following pages link to Bounds for sorting by prefix reversal (Q1253928):
Displaying 46 items.
- Greedy flipping of pancakes and burnt pancakes (Q299051) (← links)
- Data center interconnection networks are not hyperbolic (Q301597) (← links)
- Flipping triangles and rectangles (Q386439) (← links)
- A quadratic lower bound for topswops (Q410720) (← links)
- Automorphism groups of the Pancake graphs (Q413293) (← links)
- An algebraic view of bacterial genome evolution (Q476821) (← links)
- Sorting by prefix reversals and prefix transpositions (Q479021) (← links)
- Pancake flipping and sorting permutations (Q491630) (← links)
- Pancake flipping is hard (Q494050) (← links)
- Approximation algorithms for sorting by length-weighted prefix and suffix operations (Q500990) (← links)
- The super connectivity of the pancake graphs and the super laceability of the star graphs (Q557901) (← 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 by block-interchanges (Q673336) (← links)
- Sorting permutations and binary strings by length-weighted rearrangements (Q683752) (← links)
- Bounding prefix transposition distance for strings and permutations (Q764373) (← links)
- Fault-tolerant routing in burnt pancake graphs (Q765472) (← links)
- Relationship between extra edge connectivity and component edge connectivity for regular graphs (Q784476) (← links)
- A new algorithm for generation of permutations (Q795511) (← links)
- Parallel sorting on Cayley graphs (Q807014) (← links)
- Reliability analysis of the cactus-based networks (Q820572) (← links)
- An \((18/11)n\) upper bound for sorting by prefix reversals (Q838149) (← links)
- Small-diameter Cayley graphs for finite simple groups (Q914696) (← links)
- Some problems on Cayley graphs (Q952069) (← links)
- A quadratic time 2-approximation algorithm for block sorting (Q1006043) (← links)
- Ring embedding in faulty pancake graphs (Q1007619) (← links)
- Vertex reconstruction in Cayley graphs (Q1011492) (← links)
- Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs (Q1044915) (← links)
- Sorting by insertion of leading elements (Q1096394) (← links)
- Prefix and suffix reversals on strings (Q1647842) (← links)
- Flipping edge-labelled triangulations (Q1699301) (← links)
- Uniquely pressable graphs: characterization, enumeration, and recognition (Q1755655) (← links)
- On the problem of sorting burnt pancakes (Q1897357) (← links)
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement (Q1902472) (← links)
- Cycles in the burnt pancake graph (Q2009003) (← links)
- On the global strong resilience of fault Hamiltonian graphs (Q2073114) (← links)
- The generalized 4-connectivity of pancake graphs (Q2112653) (← links)
- A Hamilton cycle in the \(k\)-sided pancake network (Q2115848) (← links)
- Vulnerability analysis of multiprocessor system based on burnt pancake networks (Q2127635) (← links)
- Spectra and eigenspaces from regular partitions of Cayley (di)graphs of permutation groups (Q2174095) (← links)
- Iterative Deepening Dynamically Improved Bounds Bidirectional Search (Q5086001) (← links)
- Fast Sequential and Parallel Vertex Relabelings of <i>K<sub>m,m</sub></i> (Q5250275) (← links)
- Sorting balls and water: equivalence and computational complexity (Q6050130) (← links)
- Lengths of cycles in generalized pancake graphs (Q6056715) (← links)
- Cyclic Vertex (Edge) Connectivity of Burnt Pancake Graphs (Q6135726) (← links)
