Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms (Q5111866)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms |
scientific article; zbMATH DE number 7205191
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms |
scientific article; zbMATH DE number 7205191 |
Statements
27 May 2020
0 references
fixed-parameter tractable algorithms
0 references
treewidth
0 references
feedback vertex set
0 references
0 references
0 references
0.9968529343605042
0 references
0.8022246956825256
0 references
0.7924627065658569
0 references
0.7898682951927185
0 references
0.787139356136322
0 references
