← Search

Data · dataset · 2011

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

Listed in DataCite

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).

Description

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)]

Links

Where it is published

Documentation and papers

Catalogue records · 2

Topics

Provenance · 1 source records, 6 field assertions
SourceKeyLast seenRaw
DataCite10.4121/uuid:4b6d7f56-f09b-4507-8e1a-3078d6e0266a14 d agoJSON v1
FieldAssertionExtractorEvidence
concepts[field].fos:computer-and-information-sciencessource · DataCiteconnector:datacite@1.0.0
descriptionsource · DataCiteconnector:datacite@1.0.0/data/attributes/descriptions
license_textsource · DataCiteconnector:datacite@1.0.0
publication_datesource · DataCiteconnector:datacite@1.0.0/data/attributes/dates
titlesource · DataCiteconnector:datacite@1.0.0/data/attributes/titles/0/title
version_labelsource · DataCiteconnector:datacite@1.0.0