The complexity of the empire colouring problem (Q476435): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1109.2162 / rank | |||
Normal rank | |||
Revision as of 15:01, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of the empire colouring problem |
scientific article |
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
