2026-04-17T03:55:59Zhttps://recercat.cat/oai/request

oai:recercat.cat:2072/4528222024-06-06T09:49:14Zcom_2072_98col_2072_378195

00925njm 22002777a 4500 dc Moll, Lukas author Tazari, Siamak author Thurley, Marc author Centre de Recerca Matemàtica author 2011 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 Hipergrafs Computing hypergraph width measures exactly