A branch-and-cut algorithm for graph coloring (Q2489906)
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 branch-and-cut algorithm for graph coloring |
scientific article; zbMATH DE number 5021014
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for graph coloring |
scientific article; zbMATH DE number 5021014 |
Statements
A branch-and-cut algorithm for graph coloring (English)
0 references
28 April 2006
0 references
graph coloring
0 references
integer programming
0 references
branch-and-cut algorithms
0 references
0 references
0.8695099949836731
0 references
0.8458654284477234
0 references
0.8385658264160156
0 references
0.8198274374008179
0 references
