Large-Scale Planar Graph Instances for Max-Cut Problem
收藏DataCite Commons2025-06-10 更新2026-05-05 收录
下载链接：
https://dataverse.tdl.org/citation?persistentId=doi:10.18738/T8/57Q281
下载链接
链接失效反馈官方服务：
资源简介：
There are 225 large-scale planar graph instances for Max-Cut problems with Q matrix from 1000 by 1000 to 90000 by 90000. The instances are similar to G-set benchmark in the literature.
There are three different types of weights on the instances. The MCxx_yy_D99_a.txt instance has 1 and -1 weight. The MCxx_yy_D99_b.txt instance has random value between -10 and 10. The MCxx_yy_D99_c.txt instance has random value between -1000 and 1000.
For each instance, there is a text-file in the following format (rudy-output format):
n m
h_1 t_1 c_{h_1,t_1}
h_2 t_2 c_{h_2,t_2}
...
h_n t_n c_{h_n,t_n}
where n is the number of nodes, m the number of edges and for each edge, h_i and t_i are the end-nodes and c_{h_i,t_i} the weight. Nodes are numbered from 1 up to n. All instances are generated as complete graph
提供机构：
Texas Data Repository
创建时间：
2020-08-18
