1632 search results - page 6 / 327 » On special numberings of hypergraphs |
88
Voted
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
In this paper we initiate the study of testing properties of hypergraphs. The goal of property testing is to distinguish between the case whether a given object has a certain prope...
JGT
2007
14 years 9 months ago
2007
A 3-uniform hypergraph is called a minimum 3-tree, if for any 3-coloring of its vertex set there is a heterochromatic triple and the hypergraph has the minimum possible number of ...
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
FCT
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
EJC
2007
14 years 9 months ago
2007
We study the notion of hypertree width of hypergraphs. We prove that, up to a constant factor, hypertree width is the same as a number of other hypergraph invariants that resemble...