Generalized hypertree decompositions: np-hardness and tractable variants
Journal of the ACM (JACM), , ArticleNo.30, 2007.
conjunctive querynp-completetreeprojection problemacyclichypergraphMore(2+)
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergraphs have bounded GHW are known to be solvable in polynomial time. However,it has been an open problem for several years if for a fixed constant k and input hype...More
Best Paper of PODS, 2007