Sorting Permutations by Reversals and Eulerian Cycle

@inproceedings{Caprara1999SortingPB,
  title={Sorting Permutations by Reversals and Eulerian Cycle},
  author={Alberto Caprara},
  year={1999}
}
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 number of edge-disjoint alternating cycles in a breakpoint graph associated with a given permutation (MAX-ACD), and the problem of partitioning the edge set of an Eulerian graph into the maximum number of cycles (MAX-ECD). We first illustrate a nice characterization of breakpoint graphs, which leads… CONTINUE READING