Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - New York (Figure 6)

Datacite citation style:
Planken, L.R.(Léon); de Weerdt, Mathijs; van der Krogt, R.P.J.(Roman) (2011): Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - New York (Figure 6). Version 1. 4TU.ResearchData. dataset. https://doi.org/10.4121/uuid:4b6d7f56-f09b-4507-8e1a-3078d6e0266a
Other citation styles (APA, Harvard, MLA, Vancouver, Chicago, IEEE) available at Datacite
Dataset
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)]
history
  • 2011-03-15 first online, published, posted
publisher
TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group
format
DIMACS graph format allowing infinite arc weights media types: application/x-gzip
organizations
TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group;
University College Cork; Cork Constraint Computations Centre

DATA

files (1)