| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428235 | Information Processing Letters | 2008 | 4 Pages |
Abstract
We present an O(k3n2+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(k3.12n4) time FPT algorithm for the problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
