Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Chordal, fixed size (Figure 1)
L.R.(Léon) Planken
Mathijs de Weerdt
R.P.J.(Roman) van der Krogt
APSP, all-pairs shortest paths
STN, simple temporal network
STP, simple temporal problem
shortest path
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)]
TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group
TU Delft - Delft University of Technology
Faculty EEMCS
Algorithmics group
University College Cork
Cork Constraint Computations Centre
2011-03-15
dataset
DIMACS graph format allowing infinite arc weights
media types: application/x-gzip
10.4121/uuid:413dcbe0-99f1-4f27-a8c0-28b529c0a6d9
en
CC BY-NC-SA 3.0