Heuristic Methods for Hypertree Decomposition
- 1 January 2008
- book chapter
- Published by Springer Nature
- p. 1-11
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A backtracking-based algorithm for hypertree decompositionACM Journal of Experimental Algorithmics, 2009
- Genetic algorithms for generalised hypertree decompositionsEuropean J. of Industrial Engineering, 2007
- Hypertree Decompositions and Tractable QueriesJournal of Computer and System Sciences, 2002
- The complexity of acyclic conjunctive queriesJournal of the ACM, 2001
- A comparison of structural CSP decomposition methodsArtificial Intelligence, 2000
- Conjunctive query containment revisitedTheoretical Computer Science, 2000
- Multilevelk-way Partitioning Scheme for Irregular GraphsJournal of Parallel and Distributed Computing, 1998
- Decomposing constraint satisfaction problems using database techniquesArtificial Intelligence, 1994
- Tree clustering for constraint networksArtificial Intelligence, 1989
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986