On DRC-covering of K(n) t λ by cycles
2009 ◽
Vol 6
(2)
◽
pp. 229-237
◽
Keyword(s):
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 K (n) t ? , 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.
Keyword(s):
2017 ◽
Vol 232
◽
pp. 41-49
◽
Keyword(s):
Keyword(s):
2019 ◽
Vol 35
(5)
◽
pp. 632-648
2018 ◽
Vol 549
◽
pp. 1-11
◽