TY - DATA
T1 - Network instance Scale-free; constant vertex count, varying density, edition 2
PY - 2012/03/09
AU - L.R.(Léon) Planken
AU - Mathijs de Weerdt
AU - R.P.J.(Roman) van der Krogt
UR - https://data.4tu.nl/articles/dataset/Network_instance_Scale-free_constant_vertex_count_varying_density_edition_2/12716681/1
DO - 10.4121/uuid:db232a00-6f0b-4df3-b56e-ade64077968c
KW - APSP, all-pairs shortest paths
KW - STN, simple temporal network
KW - STP, simple temporal problem
KW - shortest path
N2 - 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)]
ER -