Tree Projections: Game Characterization and Computational Aspects

Authors:
Georg Gottlob;Gianluigi Greco;Zoltán Miklós;Francesco Scarcello;Thomas Schwentick
Affiliations:
Oxford University,;University of Calabria,;École Polytechnique Fédérale de Lausanne,;University of Calabria,;Universität Dortmund,
Venue:
Graph Theory, Computational Intelligence and Thought
Year:
2009

Citing 17
Cited 0

Solving queries by tree projections

ACM Transactions on Database Systems (TODS)
Graph searching and a min-max theorem for tree-width

Journal of Combinatorial Theory Series B
Graph sandwich problems

Journal of Algorithms
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Acyclic hypergraph projections

Journal of Algorithms
Syntactic Characterization of Tree Database Schemas

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
Computing pure nash equilibria in graphical games via markov random fields

EC '06 Proceedings of the 7th ACM conference on Electronic commerce
The complexity of homomorphism and constraint satisfaction problems seen from the other side

Journal of the ACM (JACM)
Generalized hypertree decompositions: np-hardness and tractable variants

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Hypertree width and related hypergraph invariants

European Journal of Combinatorics
Marshals, monotone marshals, and hypertree-width

Journal of Graph Theory
Tree Projections: Hypergraph Games and Minimality

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Backtracking procedures for hypertree, hyperspread and connected hypertree decomposition of CSPs

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Connected treewidth and connected graph searching

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
On the power of k-consistency

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The notion of tree projection provides a natural generalization for various structural decomposition methods, which have been proposed in the literature in order to single out classes of nearly-acyclic (hyper)graphs. In this paper, the mathematical properties of the notion of tree projection are surveyed, and the complexity of the basic tree projection problem (of deciding the existence of a tree projection) is pinpointed. In more details, a game-theoretic characterization (in terms of the Robber and Captain game [15] ) for tree projections is described, which yields a simple argument for the membership in NP of the tree projection problem. Eventually, the main ideas proposed in [14] and underlying the proof of NP-hardness of the tree projection problem are discussed.