Authors
Fedor V Fomin, Serge Gaspers, Artem V Pyatkin, Igor Razgon
Publication date
2008/10/1
Journal
Algorithmica
Volume
52
Issue
2
Pages
293-307
Publisher
Springer-Verlag
Description
We present a time algorithm finding a minimum feedback vertex set in an undirected graph on n vertices. We also prove that a graph on n vertices can contain at most 1.8638 n minimal feedback vertex sets and that there exist graphs having 105 n/10≈1.5926 n minimal feedback vertex sets.
Total citations
200820092010201120122013201420152016201720182019202020212022202320245559151514118106556774
Scholar articles
FV Fomin, S Gaspers, AV Pyatkin, I Razgon - Algorithmica, 2008