FPT algorithms for connected feedback vertex set (Q695322)
From MaRDI portal
!
WARNING
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 6117778
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | FPT algorithms for connected feedback vertex set |
scientific article; zbMATH DE number 6117778 |
Statements
FPT algorithms for connected feedback vertex set (English)
0 references
21 December 2012
0 references
parameterized algorithms
0 references
FPT algorithms
0 references
connected feedback vertex set
0 references
feedback vertex set
0 references
group Steiner tree
0 references
Steiner tree
0 references
directed Steiner out-tree
0 references
hardness of polynomial kernelization
0 references
subexponential FPT algorithms
0 references
H-minor-free graphs
0 references
dynamic programming over tree decompositions
0 references
0 references
0 references
0.99999976
0 references
0 references
0 references
0.9271584
0 references
0.9271584
0 references
0.91702527
0 references
0.91320634
0 references
0.9129559
0 references
0.9101435
0 references
