Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem (Q3625017)
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: Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem |
scientific article |
Statements
Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem (English)
0 references
7 May 2009
0 references
graph contraction
0 references
graph colouring
0 references
graph representation
0 references
heuristics
0 references
graph homomorphisms
0 references
evolutionary computation
0 references
