## Hypertree decompositions: A survey (2001)

Venue: | In: MFCS ’01: Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science |

Citations: | 29 - 4 self |

### BibTeX

@INPROCEEDINGS{Gottlob01hypertreedecompositions:,

author = {Georg Gottlob and Francesco Scarcello},

title = {Hypertree decompositions: A survey},

booktitle = {In: MFCS ’01: Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science},

year = {2001},

pages = {37--57},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. This paper surveys recent results related to the concept of hypertree decomposition and the associated notion of hypertree width. A hypertree decomposition of a hypergraph (similar to a tree decomposition of a graph) is a suitable clustering of its hyperedges yielding a tree or a forest. Important NP hard problems become tractable if restricted to instances whose associated hypergraphs are of bounded hypertree width. We also review a number of complexity results on problems whose structure is described by acyclic or nearly acyclic hypergraphs. 1