Improving graph colouring algorithms and heuristics using a novel representation (Q1742608)
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: Improving graph colouring algorithms and heuristics using a novel representation |
scientific article; zbMATH DE number 6858821
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improving graph colouring algorithms and heuristics using a novel representation |
scientific article; zbMATH DE number 6858821 |
Statements
Improving graph colouring algorithms and heuristics using a novel representation (English)
0 references
12 April 2018
0 references
graph colouring
0 references
representation
0 references
heuristics
0 references
merge model
0 references
0.9104733
0 references
0.90298074
0 references
0.9026526
0 references
0.9022869
0 references
