3- https://doi.org/10.5555/307954.307964
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
- Jan 1, 1999
- SIAM Journal on Discrete Mathematics
- Capraraalberto
Abstract
We analyze the strong relationship among three combinatorial problems, namely, the problem of sorting a permutation by the minimum number of reversals (MIN-SBR), the problem of finding the maximum ...
- # Permutation
- # Eulerian Cycle
- # Problem Of Sorting
- # Sorting
- # Combinatorial
- # Combinatorial Problems
- # Problem
- # Strong Relationship
- # Decompositions
- # Maximum
