Geodesic
On DRC-covering of λΚt(n) by cycles
Computer Science and Information Systems, Tome 6 (2009) no. 2.

Voir la notice de l'article provenant de la source Computer Science and Information Systems website

This paper considers the cycle covering of complete multipartite graphs motivated by the design of survivable WDM networks, where the requests are routed on sub-networks which are protected independently from each other. The problem can be stated as follows: for a given graph G, find a cycle covering of the edge set of λΚt(n), where V(Kt(n))=V(G), such that each cycle in the covering satisfies the disjoint routing constraint (DRC). Here we consider the case where G=Ctn, a ring of size tn and we want to minimize the number of cycles ρ(nt, λ) in the covering. For the problem, we give the lower bound of ρ(nt, λ), and obtain the optimal solutions when n is even or n is odd and both λ and t are even.
Keywords: Kt(n), DRC-covering, cycle, WDM network 
@article{CSIS_2009_6_2_a12,
     author = {Zhihe Liang},
     title = {On {DRC-covering} of {\ensuremath{\lambda}Kt(n)}  by cycles},
     journal = {Computer Science and Information Systems},
     publisher = {mathdoc},
     volume = {6},
     number = {2},
     year = {2009},
     url = {http://geodesic.mathdoc.fr/item/CSIS_2009_6_2_a12/}
}
TY  - JOUR
AU  - Zhihe Liang
TI  - On DRC-covering of λΚt(n)  by cycles
JO  - Computer Science and Information Systems
PY  - 2009
VL  - 6
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CSIS_2009_6_2_a12/
ID  - CSIS_2009_6_2_a12
ER  - 
%0 Journal Article
%A Zhihe Liang
%T On DRC-covering of λΚt(n)  by cycles
%J Computer Science and Information Systems
%D 2009
%V 6
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CSIS_2009_6_2_a12/
%F CSIS_2009_6_2_a12
Zhihe Liang. On DRC-covering of λΚt(n)  by cycles. Computer Science and Information Systems, Tome 6 (2009) no. 2. http://geodesic.mathdoc.fr/item/CSIS_2009_6_2_a12/