42 search results - page 1 / 9 » A New Algorithm for the Hypergraph Transversal Problem |
SIAMCOMP
2000
13 years 4 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
ICALP
2000
Springer
13 years 8 months ago
2000
Springer
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
STOC
2002
ACM
14 years 5 months ago
2002
ACM
This paper considers the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent o...
AAIM
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We present new kernelization results for the s-cycle transversal problem for s > 3. In particular, we show a 6k2 kernel for 4-cycle transversal and a O(ks−1 ) kernel...