An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem (Q2464330)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5221845
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem |
scientific article; zbMATH DE number 5221845 |
Statements
An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem (English)
0 references
19 December 2007
0 references
FPT technique
0 references
exponential optimality
0 references
0.9912334084510804
0 references
0.900490939617157
0 references
0.8852022290229797
0 references
0.884717583656311
0 references
