Two complexity results for the vertex coloring problem (Q505438)
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 6676771
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two complexity results for the vertex coloring problem |
scientific article; zbMATH DE number 6676771 |
Statements
Two complexity results for the vertex coloring problem (English)
0 references
23 January 2017
0 references
computational complexity
0 references
coloring problem
0 references
hereditary class
0 references
polynomial-time algorithm
0 references
0 references
0 references
0.9247539043426514
0 references
0.8898556232452393
0 references
0.8850122094154358
0 references
0.8773960471153259
0 references
0.8472420573234558
0 references
