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...
Uloženo v:
| Vydáno v: | Information processing letters Ročník 112; číslo 6; s. 238 - 242 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Amsterdam
Elsevier B.V
15.03.2012
Elsevier Sequoia S.A |
| Témata: | |
| ISSN: | 0020-0190, 1872-6119 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | 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, compute its generalized hypertree-width in time
O
⁎
(
2
n
)
and its fractional hypertree-width in time
O
(
1.734601
n
⋅
m
)
.
3
3
We omit factors polynomial in
n whenever the base of the exponent is rounded. This is justified as
c
n
⋅
n
O
(
1
)
=
O
(
(
c
+
ϵ
)
n
)
for every
ϵ
>
0
. We also use the notation
O
⁎
to suppress polynomial factors.
► We present a general exact exponential algorithm for the
f-width of a hypergraph. ► Our algorithm works for any monotone width function
f. ► This results in the currently fastest algorithm for generalized hypertree-width. ► Also this results in the currently fastest algorithm for fractional hypertree-width. |
|---|---|
| Bibliografie: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| ISSN: | 0020-0190 1872-6119 |
| DOI: | 10.1016/j.ipl.2011.12.002 |