The complexity of the empire colouring problem for linear forests (Q385396)
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 6235113
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of the empire colouring problem for linear forests |
scientific article; zbMATH DE number 6235113 |
Statements
The complexity of the empire colouring problem for linear forests (English)
0 references
2 December 2013
0 references
colouring
0 references
planar graphs
0 references
NP-hardness
0 references
algorithms
0 references
0.8938842415809631
0 references
0.8641231060028076
0 references
0.8570307493209839
0 references
0.8013802170753479
0 references
0.7620992064476013
0 references
