dc.contributor.author
Moll, Lukas
dc.contributor.author
Tazari, Siamak
dc.contributor.author
Thurley, Marc
dc.contributor.author
Centre de Recerca Matemàtica
dc.identifier
https://ddd.uab.cat/record/81056
dc.identifier
urn:oai:ddd.uab.cat:81056
dc.description.abstract
Hypergraph width measures are a class of hypergraph invariants important in studying the complexity of constraint satisfaction problems (CSPs). We present a general exact exponential algorithm for a large variety of these measures. A connection between these and tree decompositions is established. This enables us to almost seamlessly adapt the combinatorial and algorithmic results known for tree decompositions of graphs to the case of hypergraphs and obtain fast exact algorithms. As a consequence, we provide algorithms which, given a hypergraph H on n vertices and m hyperedges, compute the generalized hypertree-width of H in time O*(2n) and compute the fractional hypertree-width of H in time O(1.734601n.m).1
dc.format
application/pdf
dc.publisher
Centre de Recerca Matemàtica
dc.relation
Centre de Recerca Matemàtica. Prepublicacions ;
dc.rights
Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, i la comunicació pública de l'obra, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original. No es permet la creació d'obres derivades.
dc.rights
https://creativecommons.org/licenses/by-nc-nd/2.5/
dc.title
Computing hypergraph width measures exactly
