An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem
about
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem
description
wetenschappelijk artikel
@nl
наукова стаття, опублікована в листопаді 2016
@uk
name
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem
@en
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem
@nl
type
label
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem
@en
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem
@nl
prefLabel
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem
@en
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem
@nl
P2860
P356
P1433
P1476
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem
@en
P2093
Ian-Christopher Ternier
Virginie Gabrel
P2860
P304
P356
10.1002/NET.21716
P50
P577
2016-11-08T00:00:00Z