Hypertree-decomposition via branch-decomposition

Authors:
Marko Samer
Affiliations:
Institute of Information Systems (DBAI), Vienna University of Technology, Austria
Venue:
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Year:
2005

Citing 4
Cited 3

Eigen values and expanders

Combinatorica
Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
A comparison of structural CSP decomposition methods

Artificial Intelligence
Tour Merging via Branch-Decomposition

INFORMS Journal on Computing

Heuristic Methods for Hypertree Decomposition

MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Uniform Constraint Satisfaction Problems and Database Theory

Complexity of Constraints
Hypertree decompositions: structure, algorithms, and applications

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hypertree-decomposition is the most general approach in the literature for identifying tractable computation problems encoded as hypergraphs. We show how the heuristic branch-decomposition approach for ordinary graphs of [Cook and Seymour, 2003] can be used for the heuristic construction of hypertree-decompositions.