Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In

Dieter Kratsch
Fedor V. Fomin

Résumé

We show that for a graph $G$ on $n$ vertices its treewidth can be computed in $\mathcal{O}(poly(n) 1.9601^n)$ time. Our result is based on combinatorial upper bounds for the number of minimal separators and the number of potential maximal cliques of a graph.
Fichier non déposé

Dates et versions

hal-00085561 , version 1 (12-07-2006)

Identifiants

  • HAL Id : hal-00085561 , version 1

Citer

Dieter Kratsch, Fedor V. Fomin, Ioan Todinca. Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. 2004, pp.568-580. ⟨hal-00085561⟩
1610 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More