An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem
Date
2017Dewey
Principes généraux des mathématiquesSujet
DSATUR; Vertex Coloring Problem; graph coloring; branch-and-bound algorithm; bounding technique; computational experiments; exact algorithmJournal issue
NetworksVolume
69Number
1Publication date
2017Article pages
124-141Publisher
John Wiley & SonsCollections
Metadata
Show full item recordAuthor
Furini, Fabio
Gabrel, Virginie
Ternier, Ian-Christopher