TY - DATA
T1 - Network instance New York, edition 2
PY - 2012/03/09
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/Network_instance_New_York_edition_2/12719381/1
DO - 10.4121/uuid:fbe04397-94ba-4928-8111-be4026fc8b8d
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 170 graphs on 108–3906 vertices, 113–6422 edges, upper bound on treewidth 2–51.
Parent item:
Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2012)]
ER -