Identifying the Minimal Transversals of a Hypergraph and Related Problems
SIAM Journal on Computing
On the complexity of dualization of monotone disjunctive normal forms
Journal of Algorithms
Data mining, hypergraph transversals, and machine learning (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Hypergraph Transversal Computation and Related Problems in Logic and AI
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Translating between Horn representations and their characteristic models
Journal of Artificial Intelligence Research
A new algorithm for the hypergraph transversal problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On the complexity of enumerating pseudo-intents
Discrete Applied Mathematics
Key roles of closed sets and minimal generators in concise representations of frequent patterns
Intelligent Data Analysis
| Hi-index | 0.00 |
In this paper we study the problem of generating all keys of a formal context as well as a hypergraph. We show that computing the maximum size of a key is NP-complete. Consequently, there is no polynomial time algorithm that decides if a hypergraph is k-conformal, unless P=NP. We also present an algorithmic framework based on decomposition to enumerates all keys of a hypergraph. As example we propose a decomposition of a hypergraph into conformal hypergraphs. Computing a minimal decomposition of an arbitrary hypergraph into conformal hypergraphs remains open in this paper.