95 search results - page 11 / 19 » Covering a hypergraph of subgraphs |
139
click to vote
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
103
Voted
CORR
2010
Springer
14 years 8 months ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
107
Voted
COMBINATORICS
2006
15 years 1 months ago
2006
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc(G), and the fractional biclique partition number, bp(G), o...
255
Voted
COMPGEOM
2011
ACM
14 years 5 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
130
click to vote
CIE
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...