Sciweavers

Share
DAGSTUHL
2007
9 years 3 months ago
Directed Feedback Vertex Set Problem is FPT
To decide if the parameterized feedback vertex set problem in directed graph is fixed-parameter tractable is a long standing open problem. In this paper, we prove that the paramet...
Jianer Chen, Yang Liu 0002, Songjian Lu
CIAC
2006
Springer
111views Algorithms» more  CIAC 2006»
9 years 6 months ago
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...
SWAT
2010
Springer
260views Algorithms» more  SWAT 2010»
9 years 7 months ago
Isomorphism for Graphs of Bounded Feedback Vertex Set Number
This paper presents an O(n2 ) algorithm for deciding isomorphism of graphs that have bounded feedback vertex set number. This number is defined as the minimum number of vertex de...
Stefan Kratsch, Pascal Schweitzer
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...
ISAAC
2005
Springer
97views Algorithms» more  ISAAC 2005»
9 years 8 months ago
A Min-Max Relation on Packing Feedback Vertex Sets
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...
Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang
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
ICALP
2005
Springer
9 years 8 months ago
The Generalized Deadlock Resolution Problem
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
Kamal Jain, Mohammad Taghi Hajiaghayi, Kunal Talwa...
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...
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
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
books