\input zb-basic
\input zb-ioport
\iteman{io-port 05377146}
\itemau{Fomin, Fedor V.; Gaspers, Serge; Pyatkin, Artem V.; Razgon, Igor}
\itemti{On the minimum feedback vertex set problem: Exact and enumeration algorithms.}
\itemso{Algorithmica 52, No. 2, 293-307 (2008).}
\itemab
Summary: We present a time $\cal {O}(1.7548^{n})$ 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}\approx 1.5926^n$ minimal feedback vertex sets.
\itemrv{~}
\itemcc{}
\itemut{minimum feedback vertex set; maximum induced forest; exact exponential algorithm; number of minimal feedback vertex sets}
\itemli{doi:10.1007/s00453-007-9152-0}
\end