Pages that link to "Item:Q2490115"
From MaRDI portal
The following pages link to A simpler and faster 1.5-approximation algorithm for sorting by transpositions (Q2490115):
Displaying 9 items.
- Tighter upper bound for sorting permutations with prefix transpositions (Q497672) (← links)
- The transposition median problem is NP-complete (Q631772) (← links)
- \(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges (Q729890) (← links)
- Bounding prefix transposition distance for strings and permutations (Q764373) (← links)
- Sorting permutations with transpositions in \(O(n^3)\) amortized time (Q1731847) (← links)
- The complexity of string partitioning (Q2343298) (← links)
- Sorting by Transpositions Is Difficult (Q3012840) (← links)
- CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS (Q5150721) (← links)
- Constant time and space updates for the sigma-tau problem (Q6545441) (← links)
