AbstractIf π is a permutation of {1,…,n}, then the effect of the swap Sij on π is that the ith and fth entry are sorted. If [i−j] = l, we call Sij a miniswap (it sorts neighbours). The paper studies a partial order based on the swaps, and establishes some properties of miniswaps
The special purpose sorting operation, context directed swap (CDS), is an example of the block inter...
Sorting is one of the fundamental operations in computer science, and many sequential and parallel a...
Sorting permutations by operations such as reversals and block-moves has received much interest beca...
AbstractIf π is a permutation of {1,…,n}, then the effect of the swap Sij on π is that the ith and f...
As a preparation to the study of a particular sorting machine, the sorting of arrays by sequences of...
AbstractAs a preparation to the study of a particular sorting machine, the sorting of arrays by sequ...
A miniswap Si,1 ≤ i \u3c n, compares two adjacent keys Пi, Пi+1 in the sequence (П1, ... , Пn), and ...
this paper, we study the problem of sorting permutations and circular permutations using as few fixe...
A short swap is an operation that switches two elements that have at most one element in between. In...
We investigate the sorting of permutations using context directed swaps (CDS). Sorting has important...
A short swap switches two elements with at most one element caught between them. Sorting permutation...
International audienceGeneralizing stack sorting and c-sorting for permutations, we define the permu...
A number of fields, including the study of genome rearrangements and the design of interconnection n...
Gu et al. gave a 2-approximation for computing the minimal number of inversions and transpositions n...
AbstractGu et al. gave a 2-approximation for computing the minimal number of inversions and transpos...
The special purpose sorting operation, context directed swap (CDS), is an example of the block inter...
Sorting is one of the fundamental operations in computer science, and many sequential and parallel a...
Sorting permutations by operations such as reversals and block-moves has received much interest beca...
AbstractIf π is a permutation of {1,…,n}, then the effect of the swap Sij on π is that the ith and f...
As a preparation to the study of a particular sorting machine, the sorting of arrays by sequences of...
AbstractAs a preparation to the study of a particular sorting machine, the sorting of arrays by sequ...
A miniswap Si,1 ≤ i \u3c n, compares two adjacent keys Пi, Пi+1 in the sequence (П1, ... , Пn), and ...
this paper, we study the problem of sorting permutations and circular permutations using as few fixe...
A short swap is an operation that switches two elements that have at most one element in between. In...
We investigate the sorting of permutations using context directed swaps (CDS). Sorting has important...
A short swap switches two elements with at most one element caught between them. Sorting permutation...
International audienceGeneralizing stack sorting and c-sorting for permutations, we define the permu...
A number of fields, including the study of genome rearrangements and the design of interconnection n...
Gu et al. gave a 2-approximation for computing the minimal number of inversions and transpositions n...
AbstractGu et al. gave a 2-approximation for computing the minimal number of inversions and transpos...
The special purpose sorting operation, context directed swap (CDS), is an example of the block inter...
Sorting is one of the fundamental operations in computer science, and many sequential and parallel a...
Sorting permutations by operations such as reversals and block-moves has received much interest beca...
DOI
Add to ORKG