2 search results - page 1 / 1 » Faster Exact and Parameterized Algorithm for Feedback Vertex... |
FSTTCS
2009
Springer
14 years 5 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...