Lower bounding techniques for DSATUR-based branch and bound (Q325423)
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 6640268
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounding techniques for DSATUR-based branch and bound |
scientific article; zbMATH DE number 6640268 |
Statements
Lower bounding techniques for DSATUR-based branch and bound (English)
0 references
18 October 2016
0 references
graph coloring
0 references
DSATUR
0 references
branch-and-bound algorithm
0 references
0 references
0.9412418007850648
0 references
0.8189797401428223
0 references
0.808555543422699
0 references
0.8049820065498352
0 references
0.7960827350616455
0 references
