---
title: "Hypertree-decomposition via Branch-decomposition"
authors:
  - "Marko Samer"
doi: ""
url: "https://ijcai.org/proceedings/2005/308"
pdf: "https://ijcai.org/proceedings/2005/0308.pdf"
venue: "Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence"
year: 2005
pages: "1535-1535"
track: ""
keywords:
---

# Hypertree-decomposition via Branch-decomposition

Marko Samer

*Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence*, pages 1535-1535.

## 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.