Sciweavers

Share
1992 search results - page 1 / 399
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
WADS
2007
Springer
114views Algorithms» more  WADS 2007»
9 years 8 months ago
Improved Algorithms for the Feedback Vertex Set Problems
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...
Jianer Chen, Fedor V. Fomin, Yang Liu 0002, Songji...
WADS
2005
Springer
108views Algorithms» more  WADS 2005»
9 years 8 months ago
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Nie...
ICTCS
2005
Springer
9 years 8 months ago
Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems
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...
Venkatesh Raman, Saket Saurabh, Somnath Sikdar
TAMC
2009
Springer
9 years 9 months ago
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
We consider the feedback vertex set and feedback arc set problems in bipartite tournaments. We improve on recent results by giving a 2-approximation algorithm for the feedback vert...
Anke van Zuylen
STACS
2007
Springer
9 years 8 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
books