Network instance New York, edition 2



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)
Date made available9 Mar 2012
PublisherTU Delft - 4TU.ResearchData
Date of data production9 Mar 2012 - 25 Jul 2020

Cite this