19 search results - page 1 / 4 » Computing Minimum Directed Feedback Vertex Set in O(1.9977n) |
130
Voted
ICTCS
2007
Springer
15 years 7 months ago
2007
Springer
124
click to vote
JCO
1998
15 years 22 days ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
129
Voted
STACS
2007
Springer
15 years 7 months ago
2007
Springer
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...
94
Voted
DAM
2008
15 years 1 months ago
2008
We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for AT-free graphs, and extending this approach we obtain a polynomial time algorithm for ...
126
Voted
DAM
2000
15 years 26 days ago
2000
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...