Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
Easy problems for tree-decomposable graphs
Journal of Algorithms
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Solving queries by tree projections
ACM Transactions on Database Systems (TODS)
Journal of Algorithms
Acyclic hypergraph projections
Journal of Algorithms
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Conjunctive query containment revisited
Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
A comparison of structural CSP decomposition methods
Artificial Intelligence
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth 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
Weighted hypertree decompositions and optimal query plans
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Marshals, monotone marshals, and hypertree-width
Journal of Graph Theory
Bounded treewidth as a key to tractability of knowledge representation and reasoning
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
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
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
A backtracking-based algorithm for hypertree decomposition
Journal of Experimental Algorithmics (JEA)
Heuristic Methods for Hypertree Decomposition
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
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
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results
Graph Theory, Computational Intelligence and Thought
Tree Projections: Game Characterization and Computational Aspects
Graph Theory, Computational Intelligence and Thought
Approximating fractional hypertree width
ACM Transactions on Algorithms (TALG)
On the power of structural decompositions of graph-based representations of constraint problems
Artificial Intelligence
Balanced queries: divide and conquer
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Boosting tuple propagation in multi-relational classification
Proceedings of the 15th Symposium on International Database Engineering & Applications
Worst-case optimal join algorithms: [extended abstract]
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs
Theoretical Computer Science
| Hi-index | 0.00 |
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergraphs have bounded GHW are known to be solvable in polynomial time. However,it has been an open problem for several years if for a fixed constant k and input hypergraph H it can be determined in polynomial time whether GHW(H)