Graph Coloring Problems

该数据集包含了每个变量具有三种值（颜色）的问题，相邻两个变量之间的相等赋值会产生10到100之间的随机成本，而不相等的赋值则成本为0。数据集的密度设定为0.05。此外，该数据集在多种通信场景下进行了评估，包括完美通信和消息延迟。规模上，数据集包含了100个问题实例，每个实例有50个代理。任务类型为分布式约束优化问题（Dcops）。

This dataset contains problems where each variable has three possible values (colors). Equal assignments between two adjacent variables will incur a random cost ranging from 10 to 100, while unequal assignments will result in a cost of 0. The density of the dataset is set to 0.05. Furthermore, this dataset has been evaluated across multiple communication scenarios, including perfect communication and message delay conditions. In terms of scale, the dataset includes 100 problem instances, each with 50 agents. The task type is Distributed Constraint Optimization Problem (DCOP).