Corrigendum to ``Variable space search for graph coloring [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)]
From MaRDI portal
Publication:1028098
DOI10.1016/j.dam.2008.11.008zbMath1237.05076MaRDI QIDQ1028098
Nicolas Zufferey, Matthieu Plumettaz, Alain Hertz
Publication date: 30 June 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.11.008
68Q25: Analysis of algorithms and problem complexity
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
A formulation space search heuristic for packing unequal circles in a fixed size circular container, A heuristic for the circle packing problem with a variety of containers, Packing unequal rectangles and squares in a fixed size circular container using formulation space search, Packing a fixed number of identical circles in a circular container with circular prohibited areas, A note on solving MINLP's using formulation space search
Cites Work