A note on the Cornaz-Jost transformation to solve the graph coloring problem (Q2444903)
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 6282956
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the Cornaz-Jost transformation to solve the graph coloring problem |
scientific article; zbMATH DE number 6282956 |
Statements
A note on the Cornaz-Jost transformation to solve the graph coloring problem (English)
0 references
11 April 2014
0 references
graph coloring problem
0 references
graph operators
0 references
max-coloring problem
0 references
polynomial-time algorithm
0 references
computational complexity
0 references
0.8025817275047302
0 references
0.7624935507774353
0 references
0.7373738288879395
0 references
0.7274935841560364
0 references
0.7273120880126953
0 references
