Benchmark Set for Dominating Set Reconfiguration Problem
收藏arXiv2025-09-30 收录
下载链接:
https://core-challenge.github.io/2022/
下载链接
链接失效反馈官方服务:
资源简介:
该数据集是对支配集重构问题的一个基准测试集,包含442个实例,其中310个是可达实例,132个是不可达实例。这些数据集旨在评估所提出的基于答案集编程(ASP)方法的有效性。所有基准实例均采用DIMACS格式,这也为其他方法和求解器提供了便利。数据集的规模从442个实例(310个可达,132个不可达)不等,节点数量从11到1000,边数量从20到449,449。任务目标是评估ASP编码在解决支配集重构问题上的有效性。
This dataset is a benchmark test set for the dominating set reconfiguration problem, containing 442 total instances, among which 310 are reachable and 132 are unreachable. It is designed to evaluate the effectiveness of the proposed Answer Set Programming (ASP)-based method. All benchmark instances are formatted in DIMACS standard, which provides convenience for other methods and solvers. The scale of each instance varies: the number of nodes ranges from 11 to 1000, and the number of edges ranges from 20 to 449,449. The task objective is to evaluate the effectiveness of the ASP encoding when solving the dominating set reconfiguration problem.



