General and Fractional Hypertree Decompositions: Hard and Easy Cases

SIGMOD/PODS '18: International Conference on Management of Data Houston TX USA June, 2018, pp. 17-32, 2018.

Cited by: 32|Bibtex|Views75|Links
EI

Abstract:

Hypertree decompositions, as well as the more powerful generalized hypertree decompositions (GHDs), and the yet more general fractional hypertree decompositions (FHD) are hypergraph decomposition methods successfully used for answering conjunctive queries and for the solution of constraint satisfaction problems. Every hypergraph H has a w...More

Code:

Data:

Your rating :
0

 

Tags
Comments