Dominating Set Problem Instances
收藏arXiv2025-09-30 收录
下载链接：
https://github.com/asptools/benchmarks
下载链接
链接失效反馈官方服务：
资源简介：
该数据集为随机平面图上的支配集问题生成了实例，包括正面实例（最小规模的支配集）和负面实例（将每个最优集中的一个顶点移出）。在正面实例中，包含了支配集中特定顶点的字面量，而在负面实例中，则是对最优集进行了修改。该数据集所涉及的图规模从100到550个顶点不等。这项任务旨在使用支配集问题来解释命题逻辑中的可解释性。
This dataset generates instances for the dominating set problem on random planar graphs, including positive instances (minimum-sized dominating sets) and negative instances. Each negative instance is constructed by removing one vertex from an optimal dominating set. Positive instances contain literals corresponding to specific vertices included in the given dominating set, while negative instances are modified versions of the optimal sets. The graphs involved in this dataset range in size from 100 to 550 vertices. This task aims to explain interpretability in propositional logic using the dominating set problem.
提供机构：
Clingo system
