An FPT algorithm for the vertex cover \(P_4\) problem (Q906446)
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: An FPT algorithm for the vertex cover Pā problem |
scientific article; zbMATH DE number 6534177
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An FPT algorithm for the vertex cover \(P_4\) problem |
scientific article; zbMATH DE number 6534177 |
Statements
An FPT algorithm for the vertex cover \(P_4\) problem (English)
0 references
21 January 2016
0 references
graph algorithms
0 references
parameterized complexity
0 references
vertex cover \(P_4\) problem
0 references
iterative compression
0 references
0 references
0.9073426127433776
0 references
0.864635169506073
0 references
0.8403211832046509
0 references
0.8365740180015564
0 references
0.8354804515838623
0 references
