A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph.

Lev B. Levitin Mark G. Karpovsky Mehmet Mustafa Lev Zakrevski A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph. 387-420 2006 10 J. Graph Algorithms Appl. 2 http://jgaa.info/accepted/2006/Levitin+2006.10.2.pdf db/journals/jgaa/jgaa10.html#LevitinKMZ06