Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - New York (Figure 6)
datasetposted on 15.03.2011 by L.R.(Léon) Planken, M.M.(Mathijs) de Weerdt, R.P.J.(Roman) van der Krogt
Datasets usually provide raw data for analysis. This raw data often comes in spreadsheet form, but can be any collection of data, on which analysis can be performed.
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)]