Hypertree decompositions: structure, algorithms, and applications

Authors:
Georg Gottlob;Martin Grohe;nysret Musliu;Marko Samer;Francesco Scarcello
Affiliations:
Institut für Informationssysteme, TU Wien, Vienna, Austria;Institut für Informatik, Humboldt-Universität, Berlin, Germany;Institut für Informationssysteme, TU Wien, Vienna, Austria;Institut für Informationssysteme, TU Wien, Vienna, Austria;D.E.I.S., University of Calabria, Rende (CS), Italy
Venue:
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Year:
2005

Citing 22
Cited 13

A sufficient condition for backtrack-bounded search

Journal of the ACM (JACM)
Network-based heuristics for constraint-satisfaction problems

Artificial Intelligence
Tree clustering for constraint networks (research note)

Artificial Intelligence
Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
Graph searching and a min-max theorem for tree-width

Journal of Combinatorial Theory Series B
Decomposing constraint satisfaction problems using database techniques

Artificial Intelligence
Hypertree decompositions and tractable queries

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Conjunctive-query containment and constraint satisfaction

Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
A comparison of structural CSP decomposition methods

Artificial Intelligence
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of acyclic conjunctive queries

Journal of the ACM (JACM)
Computing LOGCFL certificates

Theoretical Computer Science
On Tractable Queries and Constraints

DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Optimal implementation of conjunctive queries in relational data bases

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Pure Nash equilibria: hard and easy games

Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width

SIAM Journal on Computing
Theory of Relational Databases

Theory of Relational Databases
Algorithms for acyclic database schemes

VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Marshals, monotone marshals, and hypertree-width

Journal of Graph Theory
A unified theory of structural tractability for constraint satisfaction and spread cut decomposition

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Hypertree-decomposition via branch-decomposition

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Parameterized Complexity

Parameterized Complexity

Query answering exploiting structural properties

ACM SIGMOD Record
Constraint solving via fractional edge covers

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Weighted hypertree decompositions and optimal query plans

Journal of Computer and System Sciences
Hypertree width and related hypergraph invariants

European Journal of Combinatorics
An annotated bibliography on guaranteed graph searching

Theoretical Computer Science
Approximating fractional hypertree width

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Uniform Constraint Satisfaction Problems and Database Theory

Complexity of Constraints
On the Practical Significance of Hypertree vs. TreeWidth

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Constraint satisfaction with bounded treewidth revisited

Journal of Computer and System Sciences
Approximating fractional hypertree width

ACM Transactions on Algorithms (TALG)
Constraint satisfaction with bounded treewidth revisited

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
The parameterized complexity of enumerating frequent itemsets

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 also show – as a new result – that computing hypertree decompositions is fixed-parameter intractable.