Feedback vertex set on graphs of low cliquewidth

Abstract : 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.
Type de document :
Article dans une revue
European Journal of Combinatorics, Elsevier, 2013, 34 (3), pp.666-679
Liste complète des métadonnées
Contributeur : Binh-Minh Bui-Xuan <>
Soumis le : lundi 14 novembre 2011 - 08:14:35
Dernière modification le : jeudi 13 décembre 2018 - 01:33:47


  • HAL Id : hal-00640643, version 1



Binh-Minh Bui-Xuan, Ondra Suchy, Jan Arne Telle, Martin Vatshelle. Feedback vertex set on graphs of low cliquewidth. European Journal of Combinatorics, Elsevier, 2013, 34 (3), pp.666-679. 〈hal-00640643〉



Consultations de la notice