2 search results - page 1 / 1 » Generalized hypertree decompositions: np-hardness and tracta... |
PODS
2007
ACM
14 years 4 months ago
2007
ACM
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 hypergr...
IJCAI
2007
13 years 5 months ago
2007
Hypertree decomposition has been shown to be the most general CSP decomposition method. However, so far the exact methods are not able to find optimal hypertree decompositions of...