Corrigendum to ``Variable space search for graph coloring [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)]

DOI10.1016/J.DAM.2008.11.008MaRDI QIDQ1028098zbMATH OpenOpenAlexFDO

Authors Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey

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

zbMATH Keywords

graph coloringlocal searchvariable space search

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Cites work

• A variable neighborhood search for graph coloring.
• scientific article; zbMATH DE number 956854 (Why is no real title available?)
• On edge orienting methods for graph coloring
• Reformulation descent applied to circle packing problems
• Variable neighborhood search

Cited in

(5)

• 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
• 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

This page was built for publication: Corrigendum to ``Variable space search for graph coloring [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)]

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028098)