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 the normal view instead:
scientific article; zbMATH DE number 5551718
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem |
scientific article; zbMATH DE number 5551718 |
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
0.8047555088996887
0 references
0.7865608334541321
0 references
0.7471404671669006
0 references
0.7432172298431396
0 references
