Some intersection theorems for ordered sets and graphs
Journal of Combinatorial Theory Series A
Tree clustering for constraint networks (research note)
Artificial Intelligence
Graph searching and a min-max theorem for tree-width
Journal of Combinatorial Theory Series B
Journal of the ACM (JACM)
Closure properties of constraints
Journal of the ACM (JACM)
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Degrees of acyclicity for hypergraphs and relational database schemes
Journal of the ACM (JACM)
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
A Dichotomy Theorem for Constraints on a Three-Element Set
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A Comparison of Structural CSP Decomposition Methods
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
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
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
Journal of Computer and System Sciences - Special issu on PODS 2001
Constraint Processing
The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Graphs and Hypergraphs
The Closest Substring problem with small distances
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
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
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
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
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
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
Size and treewidth bounds for conjunctive queries
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Generalized hypertree decompositions: NP-hardness and tractable variants
Journal of the ACM (JACM)
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
Algorithms for propositional model counting
Journal of Discrete Algorithms
Constraint satisfaction with bounded treewidth revisited
Journal of Computer and System Sciences
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Approximating fractional hypertree width
ACM Transactions on Algorithms (TALG)
On the power of structural decompositions of graph-based representations of constraint problems
Artificial Intelligence
Dynamic management of heuristics for solving structured CSPs
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Algorithms for propositional model counting
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
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
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Tree-width for first order formulae
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Constraint satisfaction with succinctly specified relations
Journal of Computer and System Sciences
Balanced queries: divide and conquer
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Structural tractability of enumerating CSP solutions
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A novel method for counting models on grid Boolean formulas
MCPR'10 Proceedings of the 2nd Mexican conference on Pattern recognition: Advances in pattern recognition
On guaranteeing polynomially bounded search tree size
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Structural tractability of constraint optimization
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
H-DB: a hybrid quantitative-structural sql optimizer
Proceedings of the 20th ACM international conference on Information and knowledge management
Constraint satisfaction with bounded treewidth revisited
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
The complexity of conservative valued CSPs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Computing hypergraph width measures exactly
Information Processing Letters
The structure of tractable constraint satisfaction problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Worst-case optimal join algorithms: [extended abstract]
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Size and Treewidth Bounds for Conjunctive Queries
Journal of the ACM (JACM)
Factorised representations of query results: size bounds and readability
Proceedings of the 15th International Conference on Database Theory
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
FDB: a query engine for factorised relational databases
Proceedings of the VLDB Endowment
Counting homomorphisms via hypergraph-based structural restrictions
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
On the edge cover polynomial of a graph
European Journal of Combinatorics
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)
Communication steps for parallel query processing
Proceedings of the 32nd symposium on Principles of database systems
Upper and lower bounds on the cost of a map-reduce computation
Proceedings of the VLDB Endowment
Decomposing combinatorial auctions and set packing problems
Journal of the ACM (JACM)
Aggregation and ordering in factorised databases
Proceedings of the VLDB Endowment
Theoretical Computer Science
Skew strikes back: new developments in the theory of join algorithms
ACM SIGMOD Record
Hi-index | 0.00 |
Many important combinatorial problems can be modelled as constraint satisfaction problems, hence identifying polynomial-time solvable classes of constraint satisfaction problems received a lot of attention. In this paper, we are interested in structural properties that can make the problem tractable. So far, the largest structural class that is known to be polynomial-time solvable is the class of bounded hypertree width instances introduced by Gottlob et al. [20]. Here we identify a new class of polynomial-time solvable instances: those having bounded fractional edge cover number.Combining hypertree width and fractional edge cover number, we then introduce the notion of fractional hypertree width. We prove that constraint satisfaction problems with bounded fractional hypertree width can be solved in polynomial time (provided that a the tree decomposition is given in the input). We also prove that certain parameterized constraint satisfaction, homomorphism, and embedding problems are fixed-parameter tractable on instances having bounded fractional hypertree width.