Sciweavers

Share
STACS
2016
Springer

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments

4 years 6 months ago
Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments
A tournament is a directed graph T such that every pair of vertices is connected by an arc. A feedback vertex set is a set S of vertices in T such that T −S is acyclic. In this article we consider the Feedback Vertex Set problem in tournaments. Here the input is a tournament T and 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 Feedback Vertex Set in Tournaments. The running time of
Mithilesh Kumar, Daniel Lokshtanov
Added 10 Apr 2016
Updated 10 Apr 2016
Type Journal
Year 2016
Where STACS
Authors Mithilesh Kumar, Daniel Lokshtanov
Comments (0)
books