95 search results - page 5 / 19 » Covering a hypergraph of subgraphs |
101
click to vote
SIROCCO
2001
15 years 1 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...
297
click to vote
IWOCA
2010
Springer
14 years 6 months ago
2010
Springer
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...
129
Voted
DCC
2005
IEEE
15 years 11 months ago
2005
IEEE
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
99
Voted
COCOA
2008
Springer
15 years 1 months ago
2008
Springer
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
JGT
2006
14 years 11 months ago
2006
Following [1], we investigate the problem of covering a graph G with induced subgraphs G1, . . . , Gk of possibly smaller chromatic number, but such that for every vertex u of G, ...