On the minimum feedback vertex set problem: exact and enumeration algorithms

Fomin, F.V. and Gaspers, S. and Pyatkin, A.V. and Razgon, Igor (2008) On the minimum feedback vertex set problem: exact and enumeration algorithms. Algorithmica 52 (2), pp. 293-307. ISSN 0178-4617.

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1007/s00453-007-9152-0

Abstract

We present a time O(1.7548n) 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.

Metadata

Item Type:	Article
Keyword(s) / Subject(s):	minimum feedback vertex set, maximum induced forest, exact exponential algorithm, number of minimal feedback vertex sets
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	01 Aug 2013 16:03
Last Modified:	09 Aug 2023 12:34
URI:	https://eprints.bbk.ac.uk/id/eprint/7929

Statistics

Archive Staff Only (login required)