Sciweavers

Share
117 search results - page 1 / 24
» Solving the feedback vertex set problem on undirected graphs
Sort
View
DAM
2000
137views more  DAM 2000»
9 years 1 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
ORL
1998
136views more  ORL 1998»
9 years 1 months ago
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
Fabián A. Chudak, Michel X. Goemans, Dorit ...
STACS
2007
Springer
9 years 7 months ago
A Cubic Kernel for Feedback Vertex Set
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...
Hans L. Bodlaender
MFCS
2009
Springer
9 years 8 months ago
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf ...
SODA
2016
ACM
55views Algorithms» more  SODA 2016»
3 years 9 months ago
Constant Factor Approximation for Subset Feedback Set Problems via a new LP relaxation
We consider subset feedback edge and vertex set problems in undirected graphs. The input to these problems is an undirected graph G = (V, E) and a set S = {s1, s2, . . . , sk} ⊂...
Chandra Chekuri, Vivek Madan
books