Hypertree-decomposition via Branch-decomposition
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.
Marko Samer. 2005. Hypertree-decomposition via Branch-decomposition. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05. IJCAI, 1535–1535. https://ijcai.org/proceedings/2005/308
Samer, M. (2005). Hypertree-decomposition via Branch-decomposition. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 (pp. 1535–1535). IJCAI. https://ijcai.org/proceedings/2005/308
@inproceedings{ijcai2005p308,
title = {Hypertree-decomposition via Branch-decomposition},
author = {Samer, Marko},
booktitle = {Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence, {IJCAI-05}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {1535--1535},
year = {2005},
url = {https://ijcai.org/proceedings/2005/308},
}
TY - CPAPER TI - Hypertree-decomposition via Branch-decomposition AU - Samer, Marko T2 - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 PB - International Joint Conferences on Artificial Intelligence PY - 2005 SP - 1535 EP - 1535 UR - https://ijcai.org/proceedings/2005/308 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
