%0 Generic
%A Planken, L.R.(Léon)
%A de Weerdt, Mathijs
%A van der Krogt, R.P.J.(Roman)
%D 2012
%T Network instance Scale-free; constant vertex count, varying density, edition 2
%U https://data.4tu.nl/articles/dataset/Network_instance_Scale-free_constant_vertex_count_varying_density_edition_2/12716681/1
%R 10.4121/uuid:db232a00-6f0b-4df3-b56e-ade64077968c
%K APSP, all-pairs shortest paths
%K STN, simple temporal network
%K STP, simple temporal problem
%K shortest path
%X 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)]
%I TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group