ML Anthology

Hypertree-Decomposition via Branch-Decomposition

Marko Samer
IJCAI 2005 pp. 1535-1536
/ijcai/2005/samer2005ijcai-hypertree/

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

PDF Semantic Scholar

Cite

Text

Samer. "Hypertree-Decomposition via Branch-Decomposition." International Joint Conference on Artificial Intelligence, 2005.

Markdown

[Samer. "Hypertree-Decomposition via Branch-Decomposition." International Joint Conference on Artificial Intelligence, 2005.](https://mlanthology.org/ijcai/2005/samer2005ijcai-hypertree/)

BibTeX

@inproceedings{samer2005ijcai-hypertree,
  title     = {{Hypertree-Decomposition via Branch-Decomposition}},
  author    = {Samer, Marko},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2005},
  pages     = {1535-1536},
  url       = {https://mlanthology.org/ijcai/2005/samer2005ijcai-hypertree/}
}