An approximate algorithm for the chromatic number of graphs (Q283679)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An approximate algorithm for the chromatic number of graphs |
scientific article; zbMATH DE number 6580819
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximate algorithm for the chromatic number of graphs |
scientific article; zbMATH DE number 6580819 |
Statements
An approximate algorithm for the chromatic number of graphs (English)
0 references
13 May 2016
0 references
graph coloring
0 references
approximation algorithm
0 references
chromatic number
0 references
0.8203153014183044
0 references
0.8201625347137451
0 references
0.8183999061584473
0 references
0.818385124206543
0 references
0.8131035566329956
0 references
