Pages that link to "Item:Q497672"
From MaRDI portal
The following pages link to Tighter upper bound for sorting permutations with prefix transpositions (Q497672):
Displaying 9 items.
- Bounding prefix transposition distance for strings and permutations (Q764373) (← links)
- Sorting permutations with transpositions in \(O(n^3)\) amortized time (Q1731847) (← links)
- Approximation algorithms for sorting permutations by extreme block-interchanges (Q2235751) (← links)
- A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation (Q2630342) (← links)
- Improved upper bound for sorting permutations by prefix transpositions (Q2664958) (← links)
- Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime (Q2971633) (← links)
- On Sorting by 3-Bounded Transpositions (Q3439056) (← links)
- Sorting of Permutations by Cost-Constrained Transpositions (Q5272144) (← links)
- A new upper bound for sorting permutations with prefix transpositions (Q5859487) (← links)