Network instance Scale-free; constant vertex count, varying density, edition 2
收藏DataCite Commons2021-10-31 更新2024-07-03 收录
下载链接：
https://data.4tu.nl/articles/_/12716681/1
下载链接
链接失效反馈官方服务：
资源简介：
Scale-free graphs generated following the Barabási-Albert method with 1000 vertices and density parameter varying from 2 to 80. The weights of the constraint arcs are set such that at least one solution exists (i.e. the graph contains no negative cycles and the STN is consistent). This archive contains 130 graphs on 1000 vertices, 1996–67360 edges, upper bound on treewidth 88–864. Parent item: Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2012)]
提供机构：
TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group
创建时间：
2012-04-05
