The Complexity of Minimum Convex Coloring (Q3596703)
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 5499996
| 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 5499996 |
Statements
The Complexity of Minimum Convex Coloring (English)
0 references
29 January 2009
0 references
convex coloring
0 references
maximum disjoint paths problem
0 references
0.997727632522583
0 references
0.8657739758491516
0 references
0.86530601978302
0 references
0.8533516526222229
0 references
0.8515381813049316
0 references
