Talks and Poster Presentations (with Proceedings-Entry):
W. Fischl, G. Gottlob, R. Pichler:
"General and Fractional Hypertree Decompositions: Hard and Easy Cases (extended abstract)";
Talk: AMW - Alberto Mendelzon International Workshop on Foundations of Data Management,
Cali, Kolumbien;
2018-05-21
- 2018-05-25; in: "Proceedings of the 12th Alberto Mendelzon International Workshop on Foundations of Data Management",
{CEUR} Workshop Proceedings,
(2018),
ISSN: 1613-0073;
1
- 4.
English abstract:
Hypertree decompositions, generalized hypertree decompositions, and fractional hypertree decompositions are hypergraph decomposition meth-ods successfully used for answering conjunctive queries and for the solution of constraint satisfaction problems. In this work, we present new intractability and tractability results for the problem of recognizing if a given hypergraph has a generalized or fractional hypertree decomposition of low width.
Keywords:
General and Fractional Hypertree Decompositions: Hard and Easy Cases
Created from the Publication Database of the Vienna University of Technology.