Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs (Q897965)
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: Complexity analysis of P₃-convexity problems on bounded-degree and planar graphs |
scientific article; zbMATH DE number 6517491
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs |
scientific article; zbMATH DE number 6517491 |
Statements
Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs (English)
0 references
8 December 2015
0 references
FPT
0 references
NP-completeness
0 references
parametrization
0 references
W[2]-hard
0 references
0 references
0 references
0.9665254950523376
0 references
0.834054172039032
0 references
0.813606321811676
0 references
0.7971407771110535
0 references
0.7970885634422302
0 references
