Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - New York (Figure 6)
收藏DataCite Commons2021-10-31 更新2024-07-03 收录
下载链接：
https://data.4tu.nl/articles/_/12693512/1
下载链接
链接失效反馈官方服务：
资源简介：
Directed graphs with positive edge weights grown by breadth-first search from a random point in the New York City benchmark graphs as included in the 9th DIMACS Implementation Challenge (2005). This archive contains 180 graphs on 108–4882 nodes, 113–8108 arcs, upper bound on treewidth 2–51. Parent item: Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2011)]
提供机构：
TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group
创建时间：
2012-04-03
