Geodesic
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
Journal of Graph Algorithms and Applications, Tome 10 (2006) no. 2, pp. 387-420.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in computer and communication networks, such as Networks of Workstations. The proposed Cycle Breaking algorithm, or CB algorithm, guarantees that the constructed set of prohibited turns is minimal and that the fraction of the prohibited turns does not exceed 1/3 for any graph. The computational complexity of the proposed algorithm is O(N2∆), where N is the number of vertices, and ∆ is the maximum node degree. The memory complexity of the algorithm is O(N∆). We provide lower bounds on the minimum size of cycle-breaking sets for connected graphs. Further, we construct minimal cycle-breaking sets and establish bounds on the minimum fraction of prohibited turns for two important classes of graphs, namely, t-partite graphs and graphs with small degrees. The upper bounds are tight and demonstrate the optimality of the CB algorithm for certain classes of graphs. Results of computer simulations illustrate the superiority of the proposed CB algorithm as compared to the well-known and the widely used Up/Down technique. 
@article{JGAA_2006_10_2_a14,
     author = {Lev Levitin and Mark Karpovsky and Mehmet Mustafa and Lev Zakrevski},
     title = {A {New} {Algorithm} for {Finding} {Minimal} {Cycle-Breaking} {Sets} of {Turns} in a {Graph}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {387--420},
     publisher = {mathdoc},
     volume = {10},
     number = {2},
     year = {2006},
     doi = {10.7155/jgaa.00134},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00134/}
}
TY  - JOUR
AU  - Lev Levitin
AU  - Mark Karpovsky
AU  - Mehmet Mustafa
AU  - Lev Zakrevski
TI  - A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
JO  - Journal of Graph Algorithms and Applications
PY  - 2006
SP  - 387
EP  - 420
VL  - 10
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00134/
DO  - 10.7155/jgaa.00134
LA  - en
ID  - JGAA_2006_10_2_a14
ER  - 
%0 Journal Article
%A Lev Levitin
%A Mark Karpovsky
%A Mehmet Mustafa
%A Lev Zakrevski
%T A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
%J Journal of Graph Algorithms and Applications
%D 2006
%P 387-420
%V 10
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00134/
%R 10.7155/jgaa.00134
%G en
%F JGAA_2006_10_2_a14
Lev Levitin; Mark Karpovsky; Mehmet Mustafa; Lev Zakrevski. A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph. Journal of Graph Algorithms and Applications, Tome 10 (2006) no. 2, pp. 387-420. doi : 10.7155/jgaa.00134. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00134/

Cité par Sources :