DIMACS10&SNAP
收藏arXiv2025-09-30 收录
下载链接：
https://networkrepository.com/dimacs10.php & http://snap.stanford.edu/data/
下载链接
链接失效反馈官方服务：
资源简介：
该数据集包含37个图表，其中最多拥有5.61百万个顶点，27个来自DIMACS10竞赛，另外10个来自SNAP库。在规模上，这些图表的范围涵盖从37个图表到最多5.61百万个顶点。该数据集的任务是针对最大K-缺陷团问题的算法基准测试。
This dataset contains 37 graphs, with the largest one holding up to 5.61 million vertices. Twenty-seven of the graphs are sourced from the DIMACS10 competition, and the remaining 10 are from the SNAP library. These graphs range in size from those with 37 vertices to those with up to 5.61 million vertices. This dataset is intended for algorithm benchmarking on the maximum K-defective clique problem.
提供机构：
DIMACS and SNAP搜集汇总
数据集介绍
以上内容由遇见数据集搜集并总结生成
