Feedback vertex set

Known as: Cycle Cutset, Feedback (disambiguation) 
In the mathematical discipline of graph theory, a feedback vertex set of a graph is a set of vertices whose removal leaves a graph without cycles. In… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
In this paper, we propose an algorithm that, given an undirected graph G of m edges and an integer k, computes a graph G′ and an… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
2014
2014
We present a new deterministic algorithm for the Feedback Vertex Set problem parameterized by the solution size. Our algorithm… (More)
Is this relevant?
2011
2011
A mixed graph is a graph with both directed and undirected edg es. We present an algorithm for deciding whether a given mixed gr… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We prove that given an undirected graph <i>G</i> on <i>n</i> vertices and an integer <i>k</i>, one can compute, in polynomial… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
The (parameterized) FEEDBACK VERTEX SET problem on directed graphs (i.e., the DFVS problem) is defined as follows: given a… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2007
2007
The Feedback Vertex Set problem on unweighted, undirected graphs is considered. Improving upon a result by Burrage et al. [7], we… (More)
  • figure 1
  • figure 2
Is this relevant?
2007
2007
We resolve positively a long standing open question regarding the fixed-parameter tractability of the parameterized Directed… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We show that the NP-complete FEEDBACK VERTEX SET problem, which asks for the smallest set of vertices to remove from a graph to… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2004
2004
We present an algorithm for the parameterized feedback vertex set problem that runs in time O((2 lg k + 2 lg lg k + 18)n). This… (More)
Is this relevant?
2000
2000
Given a graphG = (V ,E), the minimum feedback vertex set V is a subset of vertices of minimum size whose removal induces an… (More)
  • figure 1
Is this relevant?