An Improved DSATUR‐Based Branch‐and‐Bound Algorithm for the Vertex Coloring Problem (Q4565777)
From MaRDI portal
scientific article; zbMATH DE number 6887375
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Improved DSATUR‐Based Branch‐and‐Bound Algorithm for the Vertex Coloring Problem |
scientific article; zbMATH DE number 6887375 |
Statements
An Improved DSATUR‐Based Branch‐and‐Bound Algorithm for the Vertex Coloring Problem (English)
0 references
13 June 2018
0 references
graph coloring
0 references
DSATUR
0 references
branch-and-bound algorithm
0 references
bounding technique
0 references
computational experiments
0 references
exact algorithm
0 references
