On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms

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.

Bibliographic Details

Published in:	Algorithmica Vol. 52; no. 2; pp. 293 - 307
Main Authors:	Fomin, Fedor V., Gaspers, Serge, Pyatkin, Artem V., Razgon, Igor
Format:	Journal Article
Language:	English
Published:	New York Springer-Verlag 01.10.2008
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation Number of minimal feedback vertex sets Exact exponential algorithm Minimum feedback vertex set Maximum induced forest
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!