%0 Generic
%A Planken, L.R.(Léon)
%A de Weerdt, Mathijs
%A van der Krogt, R.P.J.(Roman)
%D 2011
%T Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Chordal, fixed size (Figure 1)
%U https://data.4tu.nl/articles/dataset/Benchmark_instances_for_experiments_in_Computing_all-pairs_shortest_paths_by_leveraging_low_treewidth_-_Chordal_fixed_size_Figure_1_/12692699/1
%R 10.4121/uuid:413dcbe0-99f1-4f27-a8c0-28b529c0a6d9
%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 400 graphs on 200 nodes, 985–19900 arcs, treewidth 5–199.
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