TY - DATA
T1 - Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Chordal, fixed size (Figure 1)
PY - 2011/03/15
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/Benchmark_instances_for_experiments_in_Computing_all-pairs_shortest_paths_by_leveraging_low_treewidth_-_Chordal_fixed_size_Figure_1_/12692699/1
DO - 10.4121/uuid:413dcbe0-99f1-4f27-a8c0-28b529c0a6d9
KW - APSP, all-pairs shortest paths
KW - STN, simple temporal network
KW - STP, simple temporal problem
KW - shortest path
N2 - 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)]
ER -