Generalized hypertree decompositions: np-hardness and tractable variants

    Journal of the ACM (JACM), , ArticleNo.30, 2007.

    Cited by: 99|Bibtex|Views16|Links
    EI
    Keywords:
    conjunctive querynp-completetreeprojection problemacyclichypergraphMore(2+)

    Abstract:

    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

    Code:

    Data:

    Your rating :
    0

     

    Best Paper
    Best Paper of PODS, 2007
    Tags
    Comments