To cite this record:
Computing hypergraph width measures exactly
Moll, Lukas
Tazari, Siamak
Thurley, Marc
Centre de Recerca Matemàtica

Imprint: Centre de Recerca Matemàtica 2011
Description: 13 p.
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.
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 Creative Commons
Language: Anglès.
Series: Prepublicacions del Centre de Recerca Matemàtica
Series: Prepublicacions del Centre de Recerca Matemàtica ; 1033
Document: preprint
Subject: Hipergrafs

Adreça alternativa:

13 p, 252.9 KB

The record appears in these collections:
Research literature > Preprints

 Record created 2011-10-31, last modified 2016-06-11

   Favorit i Compartir