Planken, L.R.(Léon); de Weerdt, Mathijs; van der Krogt, R.P.J.(Roman) (2012): Network instance New York, edition 2. Version 1. 4TU.ResearchData. dataset. https://doi.org/10.4121/uuid:fbe04397-94ba-4928-8111-be4026fc8b8d

Usage statistics

Categories

• Computation Theory and Mathematics

Keywords

APSP, all-pairs shortest paths shortest path STN, simple temporal network STP, simple temporal problem

Licence

CC BY-NC-SA 3.0

Collection

• Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2012)]

Export as...

RefWorks BibTeX Reference Manager Endnote DataCite NLM DC CFF

by L.R.(Léon) Planken, Mathijs de Weerdt , R.P.J.(Roman) van der Krogt

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

History

• 2012-03-09 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

References

• http://www.dis.uniroma1.it/~challenge9/
• https://doi.org/10.1613/jair.3509

Organizations

TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group;
University College Cork; Cork Constraint Computations Centre