32 search results - page 2 / 7 » Directed Feedback Vertex Set is Fixed-Parameter Tractable |
DAM
2008
13 years 5 months ago
2008
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
TCBB
2010
13 years 9 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...
SWAT
2010
Springer
13 years 10 months ago
2010
Springer
This paper presents an O(n2 ) algorithm for deciding isomorphism of graphs that have bounded feedback vertex set number. This number is defined as the minimum number of vertex de...
ESA
2009
Springer
14 years 5 days ago
2009
Springer
Abstract. We evaluate the performance of FPT algorithms for the directed feedback vertex set problem (DFVS). We propose several new data reduction rules for DFVS. which can signi...
ICTCS
2007
Springer
13 years 11 months ago
2007
Springer
