A Pruning Procedure for Exact Graph Coloring (Q4015385)
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: A Pruning Procedure for Exact Graph Coloring |
scientific article; zbMATH DE number 85996
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Pruning Procedure for Exact Graph Coloring |
scientific article; zbMATH DE number 85996 |
Statements
A Pruning Procedure for Exact Graph Coloring (English)
0 references
13 January 1993
0 references
computational complexity
0 references
branch-and-bound
0 references
chromatic number
0 references
graph coloring
0 references
scheduling
0 references
NP-hard
0 references
graph coloring algorithm
0 references
random graphs
0 references
search tree
0 references
0.8483101725578308
0 references
0.8198274374008179
0 references
0.8194448947906494
0 references
