4 search results - page 1 / 1 » Tractable hypergraph properties for constraint satisfaction ... |
STOC
2010
ACM
15 years 3 months ago
2010
ACM
PODS
2007
ACM
15 years 6 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...
TALG
2010
14 years 4 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
FOCS
2003
IEEE
14 years 11 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...