98 search results - page 5 / 20 » Planar Cycle Covering Graphs |
SIROCCO
2001
13 years 9 months ago
2001
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...
CPC
2008
13 years 7 months ago
2008
In 1998 Luczak, R
ALGORITHMICA
2005
13 years 7 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
SIAMDM
2010
13 years 6 months ago
2010
DAM
1999
13 years 7 months ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...