1933 search results - page 5 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
FSTTCS
2009
Springer
15 years 4 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...
75
Voted
DAM
2008
14 years 9 months ago
2008
We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for AT-free graphs, and extending this approach we obtain a polynomial time algorithm for ...
WALCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
IWPEC
2004
Springer
15 years 2 months ago
2004
Springer
