Fixed-parameter complexity of feedback vertex set in bipartite tournaments

  • Authors:

  • Sheng-Ying Hsiao

  • Affiliations:

  • Department of Computer Science and Information Engineering, National Taiwan University, Taiwan

  • Venue:
  • ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Let G be an n-node bipartite tournament, i.e., a complete bipartite graph, each of whose edges has an orientation. We address the fixed-parameter complexity of the NP-complete problem of determining, for any given parameter k, whether G admits a k-node subset whose removal from G yields an acyclic graph. The best previously known upper bound, due to Sasatte, is $O(3^k\cdot \mbox{poly}(n))$. In this paper, we show that the fixed-parameter complexity is $O(2^k\cdot\mbox{poly}(n))$.