Pages that link to "Item:Q3580936"
From MaRDI portal
The following pages link to Faster algorithms for sorting by transpositions and sorting by block interchanges (Q3580936):
Displaying 9 items.
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations (Q439973) (← links)
- \(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges (Q729890) (← links)
- An improved algorithm for sorting by block-interchanges based on permutation groups (Q991802) (← links)
- Approximation algorithms for sorting by bounded singleton moves (Q2143142) (← links)
- Approximation algorithms for sorting permutations by extreme block-interchanges (Q2235751) (← links)
- Sorting on graphs by adjacent swaps using permutation groups (Q2374257) (← 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)
