The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel

2006 ◽  
pp. 192-202 ◽  
Author(s):  
Kevin Burrage ◽  
Vladimir Estivill-Castro ◽  
Michael Fellows ◽  
Michael Langston ◽  
Shev Mac ◽  
...  
Keyword(s):  
Feedback Vertex Set ◽  
Vertex Set ◽  
Feedback Vertex Set Problem

Parameterized complexity of fair feedback vertex set problem

2021 ◽  
Vol 867 ◽  
pp. 1-12
Author(s):  
Lawqueen Kanesh ◽  
Soumen Maity ◽  
Komal Muluk ◽  
Saket Saurabh
Keyword(s):  
Parameterized Complexity ◽  
Feedback Vertex Set ◽  
Vertex Set ◽  
Feedback Vertex Set Problem

An O(2 O(k) n 3) FPT Algorithm for the Undirected Feedback Vertex Set Problem

2005 ◽  
pp. 859-869 ◽  
Author(s):  
Frank Dehne ◽  
Michael Fellows ◽  
Michael A. Langston ◽  
Frances Rosamond ◽  
Kim Stevens
Keyword(s):  
Feedback Vertex Set ◽  
Fpt Algorithm ◽  
Vertex Set ◽  
Feedback Vertex Set Problem

Applying local search to the feedback vertex set problem

2013 ◽  
Vol 19 (5) ◽  
pp. 797-818 ◽  
Author(s):  
Philippe Galinier ◽  
Eunice Lemamou ◽  
Mohamed Wassim Bouzidi
Keyword(s):  
Local Search ◽  
Feedback Vertex Set ◽  
Vertex Set ◽  
Feedback Vertex Set Problem

scholarly journals Bounds for minimum feedback vertex sets in distance graphs and circulant graphs

2008 ◽  
Vol Vol. 10 no. 1 (Graph and Algorithms) ◽  
Author(s):  
Hamamache Kheddouci ◽  
Olivier Togni
Keyword(s):  
Distance Graph ◽  
Circulant Graph ◽  
Circulant Graphs ◽  
Feedback Vertex Set ◽  
Distance Graphs ◽  
Vertex Set ◽  
Feedback Vertex Set Problem ◽  
International Audience ◽  
Minimum Feedback Vertex Set ◽  
Vertex Sets

Graphs and Algorithms International audience For a set D ⊂ Zn, the distance graph Pn(D) has Zn as its vertex set and the edges are between vertices i and j with |i − j| ∈ D. The circulant graph Cn(D) is defined analogously by considering operations modulo n. The minimum feedback vertex set problem consists in finding the smallest number of vertices to be removed in order to cut all cycles in the graph. This paper studies the minimum feedback vertex set problem for some families of distance graphs and circulant graphs depending on the value of D.

Sign in / Sign up

Export Citation Format

Share Document