Exact Algorithms for Treewidth and Minimum Fill-In

We show that the treewidth and the minimum fill-in of an $n$-vertex graph can be computed in time $\mathcal{O}(1.8899^n)$. Our results are based on combinatorial proofs that an $n$-vertex graph has $\mathcal{O}(1.7087^n)$ minimal separators and $\mathcal{O}(1.8135^n)$ potential maximal cliques. We a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:SIAM journal on computing Ročník 38; číslo 3; s. 1058 - 1079
Hlavní autoři: Fomin, Fedor V., Kratsch, Dieter, Todinca, Ioan, Villanger, Yngve
Médium: Journal Article
Jazyk:angličtina
Vydáno: Philadelphia Society for Industrial and Applied Mathematics 01.01.2008
Témata:
Algorithms
Approximation
Computer Science
Data Structures and Algorithms
Dynamic programming
Graphs
ISSN:0097-5397, 1095-7111
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!
Popis
Shrnutí:We show that the treewidth and the minimum fill-in of an $n$-vertex graph can be computed in time $\mathcal{O}(1.8899^n)$. Our results are based on combinatorial proofs that an $n$-vertex graph has $\mathcal{O}(1.7087^n)$ minimal separators and $\mathcal{O}(1.8135^n)$ potential maximal cliques. We also show that for the class of asteroidal triple-free graphs the running time of our algorithms can be reduced to $\mathcal{O}(1.4142^n)$.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0097-5397
1095-7111
DOI:10.1137/050643350