On DRC-covering of Kn by cycles - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Combinatorial Designs Year : 2003

On DRC-covering of Kn by cycles


This paper considers the cycle covering of complete graphs motivated by the design of survivable WDM networks, where the requests are routed on INF-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 Kn, where V(Kn) = V(G), such that each cycle in the covering satisfies the disjoint routing constraint (DRC), relatively to G, which can be stated as follows: to each edge of Kn we associate in G a path and all the paths associated to the edges of a cycle of the covering must be vertex disjoint. Here we consider the case where G = Cn, a ring of size n and we want to minimize the number of cycles in the covering. We give optimal solutions for the problem as well as for variations of the problem, namely, its directed version and the case when the cycle length is fixed to 4.
Fichier principal
Vignette du fichier
BCY-JCD03.pdf (220.3 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

inria-00429205 , version 1 (01-11-2009)



Jean-Claude Bermond, David Coudert, Min-Li Yu. On DRC-covering of Kn by cycles. Journal of Combinatorial Designs, 2003, 11 (2), pp.100 - 112. ⟨10.1002/jcd.10040⟩. ⟨inria-00429205⟩
144 View
177 Download



Gmail Mastodon Facebook X LinkedIn More