9 search results - page 1 / 2 » Constructions of non-principal families in extremal hypergra... |
DM
2008
13 years 11 months ago
2008
A family F of k-graphs is called non-principal if its Tur
SIAMCOMP
2000
13 years 10 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...
DIS
2008
Springer
14 years 20 days ago
2008
Springer
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We exhibit the rich structure of the set of correlated equilibria by analyzing the simplest of polynomial games: the mixed extension of matching pennies. We show that while the co...
SODA
2010
ACM
14 years 8 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...