%0 Generic
%A Planken, L.R.(Léon)
%A de Weerdt, Mathijs
%A van der Krogt, R.P.J.(Roman)
%D 2011
%T Network instance Chordal, fixed treewidth, edition 1
%U https://data.4tu.nl/articles/dataset/Network_instance_Chordal_fixed_treewidth_edition_1/12697523/1
%R 10.4121/uuid:653d9ff7-3602-4db1-be71-44dca76a04fa
%K APSP, all-pairs shortest paths
%K STN, simple temporal network
%K STP, simple temporal problem
%K shortest path
%X Chordal graphs from a self-written generator. 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 214–3125 nodes, 22788–637009 arcs, treewidth 211.
Parent item:
Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2012)]
Parent item:
Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2011)]
%I TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group