FPT algorithms for connected feedback vertex set (Q695322): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-011-9394-2 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-011-9394-2 / rank | |||
Normal rank | |||
Latest revision as of 01:00, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | FPT algorithms for connected feedback vertex set |
scientific article |
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
