14 search results - page 1 / 3 » Subset feedback vertex set is fixed parameter tractable |
CORR
2010
Springer
13 years 3 months ago
2010
Springer
CIAC
2006
Springer
13 years 9 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
DAGSTUHL
2007
13 years 7 months ago
2007
WADS
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
TCBB
2010
13 years 8 days ago
2010
Recent techniques increase rapidly the amount of our knowledge on interactions between proteins. The interpretation of these new information depends on our ability to retrieve kno...