27 search results - page 1 / 6 » On the Minimum Feedback Vertex Set Problem: Exact and Enumer... |
ALGORITHMICA
2008
13 years 8 months ago
2008
WADS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5k kn2 ). The algor...
ICTCS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most...
CORR
2011
Springer
13 years 3 days ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
STACS
2007
Springer
14 years 2 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...