Planken, L.R.(Léon); de Weerdt, Mathijs; van der Krogt, R.P.J.(Roman) (2012): Network instance Scale-free; constant vertex count, varying density, edition 2. Version 1. 4TU.ResearchData. dataset. https://doi.org/10.4121/uuid:db232a00-6f0b-4df3-b56e-ade64077968c

Dataset

• Computation Theory and Mathematics

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

CC BY-NC-SA 3.0

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

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

Scale-free graphs generated following the Barabási-Albert method with 1000 vertices and density parameter varying from 2 to 80. The weights of the constraint arcs are set such that at least one solution exists (i.e. the graph contains no negative cycles and the STN is consistent). This archive contains 130 graphs on 1000 vertices, 1996–67360 edges, upper bound on treewidth 88–864. Parent item: Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2012)]

• 2012-03-09 first online, published, posted

TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group

DIMACS graph format allowing infinite arc weights media types: application/x-gzip

• https://doi.org/10.1103/RevModPhys.74.47
• https://doi.org/10.1613/jair.3509

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