Graph Coloring using Asynchronous Weak-Commitment

WHAT IS IT?

This is the implementation of the Asynchronous Weak-Commitment Search for the graph coloring problem. We solve the graph coloring problem using the AWCS algorithm from

Makoto Yokoo and Katsutoshi Hirayama. Algorithms for Distributed Constraint Satisfaction: A Review. Autonomous Agents and Multi-Agent Systems, 3(2):185--207, 2000.

CREDITS

Ionel Muscalagiu, Jose M. Vidal

CHANGES

20100623