Network instance Scale-free; varying vertex count, bounded induced width, edition 2
收藏Figshare2012-03-09 更新2026-04-29 收录
下载链接：
https://figshare.com/articles/dataset/Network_instance_Scale-free_varying_vertex_count_bounded_induced_width_edition_2/12696905
下载链接
链接失效反馈官方服务：
资源简介：
Scale-free graphs generated following the Barabási-Albert method, then selected for induced width. 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 160 graphs on 250–1000 vertices, 2176–3330 edges, upper bound on treewidth 150–200. The scale-free density parameter for this selection is 3–15. Parent item: Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2012)]
创建时间：
2012-03-09
