Feedback vertex set on graphs of low clique-width

DOI10.1016/J.EJC.2012.07.023MaRDI QIDQ1933648zbMATH OpenOpenAlexFDO

Authors Binh-Minh Bui-Xuan, Ondřej Suchý, Jan Arne Telle, Martin Vatshelle

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

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27)

Recommendations

• Feedback vertex set on graphs of low cliquewidth
• Two feedback problems for graphs with bounded tree-width
• Mim-width. II. The feedback vertex set problem
• Fast exact algorithms for some connectivity problems parameterized by clique-width
• Parameterized and Exact Computation

Cited in

(12)

• Two feedback problems for graphs with bounded tree-width
• Mim-width. II. The feedback vertex set problem
• Subset feedback vertex set on graphs of bounded independent set size
• Boundary classes for graph problems involving non-local properties
• Fast exact algorithms for some connectivity problems parameterized by clique-width
• Computing the largest bond and the maximum connected cut of a graph
• A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width
• Feedback vertex set on graphs of low cliquewidth
• Feedback vertex set on cocomparability graphs
• Subset feedback vertex set on graphs of bounded independent set size
• Small feedback vertex sets in planar digraphs
• scientific article; zbMATH DE number 5492392 (Why is no real title available?)

This page was built for publication: Feedback vertex set on graphs of low clique-width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1933648)