Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments

TL;DR

This paper introduces a faster fixed-parameter tractable algorithm for the Feedback Vertex Set problem in bipartite tournaments, significantly improving the running time over previous methods and also providing the fastest exact exponential-time algorithm for the problem.

Contribution

The authors develop a new algorithm with improved exponential and fixed-parameter running times for Feedback Vertex Set in bipartite tournaments, surpassing prior algorithms.

Findings

New algorithm with $O(1.6181^k + n^{O(1)})$ running time

Fastest known exact exponential-time algorithm with $O(1.3820^n)$ complexity

Improved bounds over previous algorithms for the problem

Abstract

A {\em bipartite tournament} is a directed graph $T:=(A \cup B, E)$ such that every pair of vertices $(a,b), a\in A,b\in B$ are connected by an arc, and no arc connects two vertices of $A$ or two vertices of $B$. A {\em feedback vertex set} is a set $S$ of vertices in $T$ such that $T - S$ is acyclic. In this article we consider the {\sc Feedback Vertex Set} problem in bipartite tournaments. Here the input is a bipartite tournament $T$ on $n$ vertices together with an integer $k$, and the task is to determine whether $T$ has a feedback vertex set of size at most $k$. We give a new algorithm for {\sc Feedback Vertex Set in Bipartite Tournaments}. The running time of our algorithm is upper-bounded by $O(1.6181^k + n^{O(1)})$, improving over the previously best known algorithm with running time $2^kk^{O(1)} + n^{O(1)}$ [Hsiao, ISAAC 2011]. As a by-product, we also obtain the fastest currently known exact exponential-time algorithm for the problem, with running time $O(1.3820^n)$.