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.

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 52; číslo 2; s. 293 - 307
Hlavní autori:	Fomin, Fedor V., Gaspers, Serge, Pyatkin, Artem V., Razgon, Igor
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer-Verlag 01.10.2008
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	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.
ISSN:	0178-4617 1432-0541
DOI:	10.1007/s00453-007-9152-0