A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120)
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: A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem |
scientific article; zbMATH DE number 6346982
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem |
scientific article; zbMATH DE number 6346982 |
Statements
A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (English)
0 references
22 September 2014
0 references
Treewidth-2 Deletion
0 references
fixed-parameter tractable algorithms
0 references
\(K_4\)-Minor Cover
0 references
0 references
0 references
0 references
0.9973674
0 references
0.8870774
0 references
0.8597571
0 references
0.8470721
0 references
0.84707206
0 references
0.84177655
0 references
0.8410276
0 references
0.8315028
0 references
