The complexity of the empire colouring problem (Q476435)
From MaRDI portal
!
WARNING
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 6375638
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of the empire colouring problem |
scientific article; zbMATH DE number 6375638 |
Statements
The complexity of the empire colouring problem (English)
0 references
2 December 2014
0 references
colouring
0 references
planar graphs
0 references
NP-hardness
0 references
graph algorithms
0 references
0.9608375430107116
0 references
0.8938842415809631
0 references
0.8827483654022217
0 references
0.8400554060935974
0 references
0.8043093681335449
0 references
