Feedback vertex set on graphs of low clique-width
From MaRDI portal
Publication:1933648
DOI10.1016/j.ejc.2012.07.023zbMath1257.05165OpenAlexW2172910202MaRDI QIDQ1933648
Binh-Minh Bui-Xuan, Martin Vatshelle, Ondřej Suchý, Jan Arne Telle
Publication date: 24 January 2013
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2012.07.023
Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (max. 100)
Unnamed Item ⋮ Boundary classes for graph problems involving non-local properties ⋮ Computing the largest bond and the maximum connected cut of a graph ⋮ Fast exact algorithms for some connectivity problems parameterized by clique-width ⋮ Unnamed Item ⋮ Parameterized aspects of triangle enumeration ⋮ Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs ⋮ Mim-width. II. The feedback vertex set problem ⋮ Subset feedback vertex set on graphs of bounded independent set size
This page was built for publication: Feedback vertex set on graphs of low clique-width
