%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; varying vertex count, bounded induced width, edition 2
%U https://data.4tu.nl/articles/dataset/Network_instance_Scale-free_varying_vertex_count_bounded_induced_width_edition_2/12696905/1
%R 10.4121/uuid:5f6da46b-e2a2-4e05-a6cb-f22447393fb2
%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, then selected for induced width. 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 160 graphs on 250–1000 vertices, 2176–3330 edges, upper bound on treewidth 150–200. The scale-free density parameter for this selection is 3–15.
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