Hypertree Decompositions: Structure, Algorithms, and Applications.

@inproceedings{Gottlob2005, abstract = {We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We also show ??as a new result ??that computing hypertree decompositions is fixed-parameter intractable.}, author = {Gottlob, Georg and Grohe, Martin and Musliu, Nysret and Samer, Marko and Scarcello, Francesco }, booktitle = {WG}, citeulike-article-id = {1540268}, keywords = {algorithms, graph}, pages = {1--15}, posted-at = {2007-08-07 13:02:09}, priority = {2}, title = {Hypertree Decompositions: Structure, Algorithms, and Applications.}, url = {http://www.springerlink.com/content/y82vpt8wn0007974/}, year = {2005} }

TY - CONF ID - Gottlob2005 L3 - citeulike-article-id:1540268 TI - Hypertree Decompositions: Structure, Algorithms, and Applications. T2 - WG SP - 1 EP - 15 N2 - We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We also show ??as a new result ??that computing hypertree decompositions is fixed-parameter intractable. KW - algorithms KW - graph AU - Gottlob, Georg AU - Grohe, Martin AU - Musliu, Nysret AU - Samer, Marko AU - Scarcello, Francesco PY - 2005/// UR - http://www.springerlink.com/content/y82vpt8wn0007974/ ER -