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 ...
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
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...