Hypertree width and related hypergraph invariants

Authors:
Isolde Adler;Georg Gottlob;Martin Grohe
Affiliations:
Abteilung für Mathematische Logik, Albert-Ludwigs-Universität Freiburg, Eckerstr. 1, 79104 Freiburg, Germany;Institut für Informationssysteme, TU Wien, Favoritenstr. 9-11/184-2, A-1040 Wien, Austria;Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany
Venue:
European Journal of Combinatorics
Year:
2007

Citing 11
Cited 19

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
A comparison of structural CSP decomposition methods

Artificial Intelligence
A combinatorial strongly polynomial algorithm for minimizing submodular functions

Journal of the ACM (JACM)
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width

Journal of Computer and System Sciences - Special issu on PODS 2001
Constraint solving via fractional edge covers

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximating clique-width and branch-width

Journal of Combinatorial Theory Series B
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 decompositions: structure, algorithms, and applications

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Approximating rank-width and clique-width quickly

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

Efficient core computation in data exchange

Journal of the ACM (JACM)
Tree-width and functional dependencies in databases

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximating fractional hypertree width

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Tree Projections: Game Characterization and Computational Aspects

Graph Theory, Computational Intelligence and Thought
Approximating fractional hypertree width

ACM Transactions on Algorithms (TALG)
A greedy algorithm for constructing a low-width generalized hypertree decomposition

Proceedings of the 13th International Conference on Database Theory
Tractable hypergraph properties for constraint satisfaction and conjunctive queries

Proceedings of the forty-second ACM symposium on Theory of computing
The power of tree projections: local consistency, greedy algorithms, and larger islands of tractability

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximation algorithms for domination search

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Enumeration of minimal dominating sets and variants

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Decomposing Quantified Conjunctive (or Disjunctive) Formulas

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Counting homomorphisms via hypergraph-based structural restrictions

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
On minimal constraint networks

Artificial Intelligence
Structural tractability of counting of solutions to conjunctive queries

Proceedings of the 16th International Conference on Database Theory
Deciding monotone duality and identifying frequent itemsets in quadratic logspace

Proceedings of the 32nd symposium on Principles of database systems
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries

Journal of the ACM (JACM)
Tree projections and structural decomposition methods: Minimality and game-theoretic characterization

Theoretical Computer Science
Taming the infinite chase: query answering under expressive relational constraints

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 graph invariants such as bramble number, branch width, linkedness, and the minimum number of cops required to win Seymour and Thomas's robber and cops game.