Improved FPT algorithm for feedback vertex set problem in bipartite tournament

Authors:
Prashant Sasatte
Affiliations:
School of Computer Science, University of Waterloo, Ontario, Canada
Venue:
Information Processing Letters
Year:
2008

Citing 5
Cited 3

An Approximation Algorithm for Feedback Vertex Sets in Tournaments

SIAM Journal on Computing
An Approximation Algorithm for Feedback Vertex Sets in Tournaments

SIAM Journal on Computing
A Min-Max Theorem on Feedback Vertex Sets

Mathematics of Operations Research
Fixed-parameter tractability results for feedback set problems in tournaments

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Parameterized algorithms for HITTING SET: the weighted case

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity

Fixed-parameter tractability results for feedback set problems in tournaments

Journal of Discrete Algorithms
Fixed-parameter complexity of feedback vertex set in bipartite tournaments

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
A quadratic vertex kernel for feedback arc set in bipartite tournaments

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present an O(3^kn^2+n^3) time FPT algorithm for the feedback vertex set problem in a bipartite tournament on n vertices with integral weights. This improves the previously best known O(3.12^kn^4) time FPT algorithm for the problem.