Pages that link to "Item:Q4366875"
From MaRDI portal
The following pages link to On the Diameter of the Pancake Network (Q4366875):
Displayed 34 items.
- Greedy flipping of pancakes and burnt pancakes (Q299051) (← links)
- A quadratic lower bound for topswops (Q410720) (← links)
- Automorphism groups of the Pancake graphs (Q413293) (← links)
- Sorting by prefix reversals and prefix transpositions (Q479021) (← links)
- Pancake flipping and sorting permutations (Q491630) (← links)
- Pancake flipping is hard (Q494050) (← links)
- The super connectivity of the pancake graphs and the super laceability of the star graphs (Q557901) (← links)
- On average and highest number of flips in pancake sorting (Q627182) (← links)
- Sorting permutations and binary strings by length-weighted rearrangements (Q683752) (← links)
- Bounding prefix transposition distance for strings and permutations (Q764373) (← 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)
- 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)
- Survey on path and cycle embedding in some networks (Q1042541) (← links)
- Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs (Q1044915) (← links)
- Cycles in the burnt pancake graph (Q2009003) (← links)
- A Hamilton cycle in the \(k\)-sided pancake network (Q2115848) (← links)
- Spectra and eigenspaces from regular partitions of Cayley (di)graphs of permutation groups (Q2174095) (← links)
- A new general family of mixed graphs (Q2328097) (← links)
- The spectral gap of graphs arising from substring reversals (Q2363694) (← links)
- Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model (Q2378525) (← links)
- Short proofs for cut-and-paste sorting of permutations (Q2461214) (← 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)
- A NOTE ON COMPLEXITY OF GENETIC MUTATIONS (Q2890984) (← links)
- On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling (Q2942241) (← links)
- On Some Structural Properties of Star and Pancake Graphs (Q4915252) (← 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)
- Block Sorting is Hard (Q5696919) (← links)
- Physical zero-knowledge proof protocol for Topswops (Q6111599) (← links)