98 search results - page 5 / 20 » Planar Cycle Covering Graphs |
118
Voted
SIROCCO
2001
15 years 3 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...
102
Voted
CPC
2008
15 years 1 months ago
2008
In 1998 Luczak, R
118
Voted
ALGORITHMICA
2005
15 years 1 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...
89
Voted
SIAMDM
2010
15 years 7 days ago
2010
113
click to vote
DAM
1999
15 years 1 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...