Pages that link to "Item:Q497672"
From MaRDI portal
The following pages link to Tighter upper bound for sorting permutations with prefix transpositions (Q497672):
Displayed 4 items.
- Sorting permutations with transpositions in \(O(n^3)\) amortized time (Q1731847) (← links)
- Approximation algorithms for sorting permutations by extreme block-interchanges (Q2235751) (← links)
- Improved upper bound for sorting permutations by prefix transpositions (Q2664958) (← links)
- A new upper bound for sorting permutations with prefix transpositions (Q5859487) (← links)