A new algorithm for finding minimal cycle-breaking sets of turns in a graph.
Levitin, Lev ; Karpovsky, Mark ; Mustafa, Mehmet ; Zakrevski, Lev
Journal of Graph Algorithms and Applications, Tome 10 (2006), p. 387-420 / Harvested from The Electronic Library of Mathematics
Full (PDF)
Publié le : 2006-01-01
EUDML-ID : urn:eudml:doc:55418 
@article{05493570,
     title = {A new algorithm for finding minimal cycle-breaking sets of turns in a graph.},
     journal = {Journal of Graph Algorithms and Applications},
     volume = {10},
     year = {2006},
     pages = {387-420},
     zbl = {1161.68682},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05493570}
}

Levitin, Lev; Karpovsky, Mark; Mustafa, Mehmet; Zakrevski, Lev. A new algorithm for finding minimal cycle-breaking sets of turns in a graph.. Journal of Graph Algorithms and Applications, Tome 10 (2006) pp. 387-420. http://gdmltest.u-ga.fr/item/05493570/