{"type":"ScholarlyArticle","title":"Hypertree-decomposition via Branch-decomposition","authors":[{"name":"Marko Samer","slug":"marko-samer","given":"Marko","family":"Samer","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2005/308","pdf":"https://ijcai.org/proceedings/2005/0308.pdf","markdown":"https://ijcai.org/proceedings/2005/308.md","bibtex":"https://ijcai.org/proceedings/2005/bibtex/308","volume":{"slug":"2005","title":"Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2005","url":"https://ijcai.org/proceedings/2005/","year":2005,"location":"Edinburgh, Scotland, UK","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":308,"pages":{"first":1535,"last":1535},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}