TY - DATA
T1 - Network instance Chordal, fixed treewidth, edition 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/Network_instance_Chordal_fixed_treewidth_edition_1/12697523/1
DO - 10.4121/uuid:653d9ff7-3602-4db1-be71-44dca76a04fa
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 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)]
ER -