The complexity of minimum convex coloring (Q415283)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6033765
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of minimum convex coloring |
scientific article; zbMATH DE number 6033765 |
Statements
The complexity of minimum convex coloring (English)
0 references
11 May 2012
0 references
convex coloring
0 references
approximation algorithm
0 references
treewidth
0 references
maximum disjoint paths problem
0 references
set cover
0 references
0.997727632522583
0 references
0.865011990070343
0 references
0.8649828433990479
0 references
0.8527235388755798
0 references
0.8505582809448242
0 references
