Sciweavers

3 search results - page 1 / 1
» Hypertree width and related hypergraph invariants
Sort
View
EJC
2007
13 years 4 months ago
Hypertree width and related hypergraph invariants
We study the notion of hypertree width of hypergraphs. We prove that, up to a constant factor, hypertree width is the same as a number of other hypergraph invariants that resemble...
Isolde Adler, Georg Gottlob, Martin Grohe
WG
2005
Springer
13 years 10 months ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 4 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
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...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...