Hardness and inapproximability of convex recoloring problems (Q2446103)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness and inapproximability of convex recoloring problems |
scientific article |
Statements
Hardness and inapproximability of convex recoloring problems (English)
0 references
16 April 2014
0 references
convex recoloring
0 references
complexity
0 references
inapproximability
0 references
linear-time algorithm
0 references
grid graph
0 references
\((q,q-4)\)-graph
0 references
