Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

29 relations
APXAlgorithmicaArtificial IntelligenceBidimensionality
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Faster deterministic Feedback Vertex Set
We present a new deterministic algorithm for the Feedback Vertex Set problem parameterized by the solution size. Our algorithm… Expand
Highly Cited
2010
Highly Cited
2010
A 4k2 kernel for feedback vertex set
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… Expand
Highly Cited
2008
Highly Cited
2008
A fixed-parameter algorithm for the directed feedback vertex set problem
The (parameterized) FEEDBACK VERTEX SET problem on directed graphs (i.e., the DFVS problem) is defined as follows: given a… Expand
  • figure 1
Highly Cited
2007
Highly Cited
2007
Improved Algorithms for the Feedback Vertex Set Problems
We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both… Expand
  • figure 1
  • figure 2
  • figure 3
Highly Cited
2006
Highly Cited
2006
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
We show that the NP-complete Feedback Vertex Set problem, which asks for the smallest set of vertices to remove from a graph to… Expand
  • figure 1
  • figure 2
  • figure 3
Highly Cited
2000
Highly Cited
2000
An Approximation Algorithm for Feedback Vertex Sets in Tournaments
We obtain a necessary and sufficient condition in terms of forbidden structures for tournaments to possess the min-max relation… Expand
Highly Cited
2000
Highly Cited
2000
Feedback vertex set in hypercubes
Abstract Given a graph G=(V,E) , the minimum feedback vertex set V is a subset of vertices of minimum size whose removal induces… Expand
  • figure 1
Highly Cited
1999
Highly Cited
1999
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
A feedback vertex set of a graph is a subset of vertices that contains at least one vertex from every cycle in the graph. The… Expand
  • figure 4.1
Highly Cited
1998
Highly Cited
1998
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs
Abstract. This paper deals with approximating feedback sets in directed graphs. We consider two related problems: the weighted… Expand
Highly Cited
1998
Highly Cited
1998
Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
A feedback vertex set of an undirected graph is a subset of vertices that intersects with the vertex set of each cycle in the… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE