How to assign votes in a distributed system
Journal of the ACM (JACM)
On generating all maximal independent sets
Information Processing Letters
On the complexity of inferring functional dependencies
Discrete Applied Mathematics - Special issue on combinatorial problems in databases
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Exact transversal hypergraphs and application to Boolean &mgr;-functions
Journal of Symbolic Computation
Identifying the Minimal Transversals of a Hypergraph and Related Problems
SIAM Journal on Computing
Complexity of identification and dualization of positive Boolean functions
Information and Computation
On the complexity of dualization of monotone disjunctive normal forms
Journal of Algorithms
New Results on Monotone Dualization and Generating Hypergraph Transversals
SIAM Journal on Computing
Efficient dualization of O(log n)-term monotone disjunctive normal forms
Discrete Applied Mathematics
Monotone boolean dualization is in co-NP[log2n]
Information Processing Letters
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Hypergraph Transversal Computation and Related Problems in Logic and AI
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Discovering all most specific sentences
ACM Transactions on Database Systems (TODS)
An inequality for polymatroid functions and its applications
Discrete Applied Mathematics - Submodularity
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Theoretical Computer Science - Parameterized and exact computation
On the fixed-parameter tractability of the equivalence test of monotone normal forms
Information Processing Letters
The union of minimal hitting sets: parameterized combinatorial bounds and counting
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
| Hi-index | 0.00 |
In this paper we present fixed-parameter algorithms for theproblem Dual-given two hypergraphs, decide if one is the transversalhypergraph of the other-and related problems. In the first part, weconsider the number of edges of the hypergraphs, the maximum degreeof a vertex, and a vertex complementary degree as our parameters. In the second part, we use an Apriori approach to obtain FPT resultsfor generating all maximal independent sets of a hypergraph, all minimaltransversals of a hypergraph, and all maximal frequent sets whereparameters bound the intersections or unions of edges.