The complexity of the empire colouring problem (Q476435): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3103087101 / rank | |||
Normal rank |
Revision as of 02:26, 20 March 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