cff-version: 1.2.0
abstract: "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)]"
authors:
  - family-names: Planken
    given-names: L.R.(Léon)
  - family-names: de Weerdt
    given-names: Mathijs
    orcid: "https://orcid.org/0000-0002-0470-6241"
  - family-names: van der Krogt
    given-names: R.P.J.(Roman)
title: "Network instance New York, edition 2"
keywords:
version: 1
identifiers:
  - type: doi
    value: 10.4121/uuid:fbe04397-94ba-4928-8111-be4026fc8b8d
license: CC BY-NC-SA 3.0
date-released: 2012-03-09