Improved FPT algorithm for feedback vertex set problem in bipartite tournament

https://doi.org/10.1016/j.ipl.2007.08.014Get rights and content

Abstract

We present an O(3kn2+n3) 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.12kn4) time FPT algorithm for the problem.

References (4)

  • M. Cai et al.

    An approximation algorithm for feedback vertex sets in tournaments

    SIAM J. Comput.

    (2001)
  • M. Cai et al.

    A min–max theorem on feedback vertex sets

    Math. Oper. Res.

    (2002)
There are more references available in the full text version of this article.

Cited by (0)

View full text
Copyright © 2007 Elsevier B.V. All rights reserved.