000081056 001 __ 81056
000081056 005 __20140607080524.0
000081056 024 8_ $9 driver $a oai:ddd.uab.cat:81056
000081056 035 __ $a oai:www.recercat.cat:2072/171357
000081056 041 __ $a eng
000081056 080 __ $a 519.1
000081056 100 1_ $a Moll, Lukas
000081056 245 10 $a Computing hypergraph width measures exactly
000081056 260 __ $b Centre de Recerca Matemàtica $c 2011
000081056 300 __ $a 13 p.
000081056 520 3_ $a 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
000081056 540 __ $a 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 $u http://creativecommons.org/licenses/by-nc-nd/2.5/es/
000081056 546 __ $a Anglès.
000081056 653 __ $a Hipergrafs
000081056 655 _4 $a info:eu-repo/semantics/preprint
000081056 700 1_ $a Tazari, Siamak
000081056 700 1_ $a Thurley, Marc
000081056 710 1_ $a Centre de Recerca Matemàtica
000081056 762 18 $w hdl_2072_1177
000081056 830 __ $a Prepublicacions del Centre de Recerca Matemàtica ; $v 1033
000081056 856 40 $p 13 $s 258955 $u http://ddd.uab.cat/pub/prepub/2011/hdl_2072_171357/Pr1033.pdf
000081056 856 42 $3 Adreça alternativa $u http://hdl.handle.net/2072/171357
000081056 980 __ $a PREPUB $b UAB