Efficient Constraint Propagation for Graph Coloring

DOI10.1016/j.endm.2011.05.042zbMath1268.68149OpenAlexW2041631618MaRDI QIDQ2840716

Fred Hemery, Frédéric Boussemart, Mouny Samy Modeliar, Christophe Lecoutre

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.042

zbMATH Keywords

graph coloringconstraint propagationarc consistency

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Collective dynamics of ‘small-world’ networks
• Unnamed Item

This page was built for publication: Efficient Constraint Propagation for Graph Coloring