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ženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 52; číslo 2; s. 293 - 307
Hlavní autoři:	Fomin, Fedor V., Gaspers, Serge, Pyatkin, Artem V., Razgon, Igor
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer-Verlag 01.10.2008
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

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