TY - DATA
T1 - Network instance Chordal, fixed size, edition 2
PY - 2012/03/09
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_size_edition_2/12719555/1
DO - 10.4121/uuid:fea4f033-6bc1-46d8-81f4-d17115304fdb
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 250 graphs on 1000 vertices, 75840–499490 edges, treewidth 79–995.
Parent item:
Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2012)]
ER -