TY - DATA
T1 - Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - New York (Figure 6)
PY - 2011/03/15
AU - L.R.(Léon) Planken
AU - Mathijs de Weerdt
AU - R.P.J.(Roman) van der Krogt
UR - https://data.4tu.nl/articles/dataset/Benchmark_instances_for_experiments_in_Computing_all-pairs_shortest_paths_by_leveraging_low_treewidth_-_New_York_Figure_6_/12693512/1
DO - 10.4121/uuid:4b6d7f56-f09b-4507-8e1a-3078d6e0266a
KW - APSP, all-pairs shortest paths
KW - STN, simple temporal network
KW - STP, simple temporal problem
KW - shortest path
N2 - 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)]
ER -