Feedback vertex set on graphs of low cliquewidth - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Combinatorics Année : 2013

Feedback vertex set on graphs of low cliquewidth

Résumé

The Feedback Vertex Set problem asks whether a graph contains $q$ vertices meeting all its cycles. This is not a local property, in the sense that we cannot check if $q$ vertices meet all cycles by looking only at their neighbors. Dynamic programming algorithms for problems based on non-local properties are usually more complicated. In this paper, given a graph $G$ of clique-width $cw$ and a $cw$-expression of $G$, we solve the Minimum Feedback Vertex Set problem in time $O(n^22^{O(cw \log cw)})$. Our algorithm applies dynamic programming on a so-called $k$-module decomposition of a graph, as defined by Rao \cite{R08}, which is easily derivable from a $k$-expression of the graph. The related notion of module-width of a graph is tightly linked to both clique-width and NLC-width, and in this paper we give an alternative equivalent characterization of module-width.
Fichier non déposé

Dates et versions

hal-00640643 , version 1 (14-11-2011)

Identifiants

  • HAL Id : hal-00640643 , version 1

Citer

Binh-Minh Bui-Xuan, Ondra Suchy, Jan Arne Telle, Martin Vatshelle. Feedback vertex set on graphs of low cliquewidth. European Journal of Combinatorics, 2013, 34 (3), pp.666-679. ⟨hal-00640643⟩
124 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More