Constraint propagation in graph coloring

DOI10.1023/A:1013665718444zbMath1073.90538OpenAlexW1597133315MaRDI QIDQ5960033

Paolo Dell'Olmo, Massimiliano Caramia

Publication date: 11 April 2002

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1013665718444

zbMATH Keywords

lower boundheuristic algorithmscliquevertex coloringbinary constraintsedge consistency

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Coloring graphs by iterated local search traversing feasible and infeasible solutions ⋮ Embedding a novel objective function in a two-phased local search for robust vertex coloring

This page was built for publication: Constraint propagation in graph coloring