Corpus ID: 211096635

Complexity Analysis of General and Fractional Hypertree Decompositions

@article{Gottlob2020ComplexityAO,
  title={Complexity Analysis of General and Fractional Hypertree Decompositions},
  author={Georg Gottlob and Matthias Lanzinger and Reinhard Pichler and Igor Razgon},
  journal={ArXiv},
  year={2020},
  volume={abs/2002.05239}
}
  • Georg Gottlob, Matthias Lanzinger, +1 author Igor Razgon
  • Published in ArXiv 2020
  • Computer Science, Mathematics
  • Hypertree decompositions (HDs), as well as the more powerful generalized hypertree decompositions (GHDs), and the yet more general fractional hypertree decompositions (FHDs) are hypergraph decomposition methods successfully used for answering conjunctive queries and for solving constraint satisfaction problems. Every hypergraph $H$ has a width relative to each of these methods: its hypertree width $hw(H)$, its generalized hypertree width $ghw(H)$, and its fractional hypertree width $fhw(H… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 50 REFERENCES

    Approximating fractional hypertree width

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    FAQ: Questions Asked Frequently

    VIEW 1 EXCERPT

    Old techniques for new join algorithms: A case study in RDF processing

    VIEW 1 EXCERPT