Some intersection theorems for ordered sets and graphs
Journal of Combinatorial Theory Series A
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree
Journal of Algorithms
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Closure properties of constraints
Journal of the ACM (JACM)
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
When is the evaluation of conjunctive queries tractable?
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The complexity of maximal constraint languages
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation algorithms
A Dichotomy Theorem for Constraints on a Three-Element Set
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Tractable conservative Constraint Satisfaction Problems
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
A Combinatorial Proof of Kneser’s Conjecture
Combinatorica
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Approximating clique-width and branch-width
Journal of Combinatorial Theory Series B
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Journal of Combinatorial Theory Series B
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
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
The structure of tractable constraint satisfaction problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
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
The complexity of conservative valued CSPs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Constraint optimization problems and bounded tree-width revisited
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Counting homomorphisms via hypergraph-based structural restrictions
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Structural tractability of counting of solutions to conjunctive queries
Proceedings of the 16th International Conference on Database Theory
The complexity of conservative valued CSPs
Journal of the ACM (JACM)
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
Journal of the ACM (JACM)
Skew strikes back: new developments in the theory of join algorithms
ACM SIGMOD Record
Hi-index | 0.00 |
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, Constraint Satisfaction Problems (CSP) and various problems in database theory are polynomial-time solvable if the input contains a bounded-width fractional hypertree decomposition of the hypergraph of the constraints. In this article, we show that for every fixed w ≥ 1, there is a polynomial-time algorithm that, given a hypergraph H with fractional hypertree width at most w, computes a fractional hypertree decomposition of width O(w3) for H. This means that polynomial-time algorithms relying on bounded-width fractional hypertree decompositions no longer need to be given a decomposition explicitly in the input, since an appropriate decomposition can be computed in polynomial time. Therefore, if H is a class of hypergraphs with bounded fractional hypertree width, then a CSP restricted to instances whose structure is in H is polynomial-time solvable. This makes bounded fractional hypertree width the most general known hypergraph property that makes CSP, Boolean conjunctive queries, and conjunctive query containment polynomial-time solvable.