Hypertree-decomposition via branch-decomposition

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 1535-1536

  Samer, Marko ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH DECOMPOSITION; COMPUTATION PROBLEMS; GENERAL APPROACH; HYPER GRAPH;

ARTIFICIAL INTELLIGENCE;

EID: 33744943485     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. N. Alon. Eigenvalues and expanders. Combinatorica, 6(2):83-96, 1986.
2. W. Cook and P. Seymour. Tour merging via branch-decomposition. INFORMS Journal on Computing, 15(3):233-248, 2003. (Pubitemid 39042719)
3. G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural CSP decomposition methods. Artificial Intelligence, 124(2):243-282, 2000. (Pubitemid 32029459)
4. G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. Journal of Computer and System Sciences, 64(3):579-627, 2002.
5. B. McMahan. Bucket eliminiation and hypertree decompositions. Implementation report, Institute of Information Systems (DBAI), TU Vienna, 2004.
6. N. Robertson and P. Seymour. Graph minors. X. Obstructions to tree-decomposition. Journal of Combinatorial Theory, Series B, 52:153-190, 1991.