An Improved DSATUR‐Based Branch‐and‐Bound Algorithm for the Vertex Coloring Problem

DOI10.1002/net.21716zbMath1388.05063OpenAlexW2551867551WikidataQ57659011 ScholiaQ57659011MaRDI QIDQ4565777

Virginie Gabrel, Ian-Christopher Ternier, Fabio Furini

Publication date: 13 June 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21716

zbMATH Keywords

branch-and-bound algorithmcomputational experimentsgraph coloringexact algorithmDSATURbounding technique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Uncertain vertex coloring problem ⋮ Graph coloring with decision diagrams

This page was built for publication: An Improved DSATUR‐Based Branch‐and‐Bound Algorithm for the Vertex Coloring Problem