dc.contributor
Centre de Recerca Matemàtica
dc.contributor.author
Moll, Lukas
dc.contributor.author
Tazari, Siamak
dc.contributor.author
Thurley, Marc
dc.date.accessioned
2011-10-24T08:06:45Z
dc.date.accessioned
2024-09-19T13:21:45Z
dc.date.available
2011-10-24T08:06:45Z
dc.date.available
2024-09-19T13:21:45Z
dc.identifier.uri
http://hdl.handle.net/2072/171357
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
cat
dc.format.extent
258955 bytes
dc.format.mimetype
application/pdf
dc.publisher
Centre de Recerca Matemàtica
ca
dc.relation.ispartofseries
Prepublicacions del Centre de Recerca Matemàtica;1033
dc.rights
Aquest document està subjecte a una llicència d'ús de Creative Commons, amb la qual es permet copiar, distribuir i comunicar públicament l'obra sempre que se'n citin l'autor original, la universitat i el centre i no se'n faci cap ús comercial ni obra derivada, tal com queda estipulat en la llicència d'ús (http://creativecommons.org/licenses/by-nc-nd/2.5/es/)
cat
dc.subject.other
Hipergrafs
ca
dc.title
Computing hypergraph width measures exactly
ca
dc.type
info:eu-repo/semantics/preprint
ca
