On the Complexity of Solving or Approximating Convex Recoloring Problems (Q4925275)
From MaRDI portal
scientific article; zbMATH DE number 6174190
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Solving or Approximating Convex Recoloring Problems |
scientific article; zbMATH DE number 6174190 |
Statements
On the Complexity of Solving or Approximating Convex Recoloring Problems (English)
0 references
11 June 2013
0 references
convex recoloring
0 references
NP-hardness
0 references
inapproximability
0 references
polynomial algorithm
0 references
grid graph
0 references
cograph
0 references
sparse graph
0 references
