Computing hypergraph width measures exactly

Hypergraph width measures are important in studying the complexity of constraint satisfaction problems (CSPs). We present a general exact exponential algorithm for a large variety of these measures. As a consequence, we obtain algorithms which, for a hypergraph H on n vertices and m hyperedges, comp...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 112; no. 6; pp. 238 - 242
Main Authors:	Moll, Lukas, Tazari, Siamak, Thurley, Marc
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 15.03.2012 Elsevier Sequoia S.A
Subjects:	Algorithms Complexity Complexity theory Computation Design of algorithms Exact exponential algorithms Exponents Fractional hypertree-width Generalized hypertree-width Graph algorithms Graph theory Graphs Optimization algorithms Studies Exact exponential algorithms Graph algorithms Design of algorithms Fractional hypertree-width Generalized hypertree-width
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!