Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Scale-free; constant vertex count, varying density (Figure 3)
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
Scale-free graphs generated following the Barabási-Albert method with 150 vertices and density parameter varying from 2 to 20. 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 190 graphs on 150 nodes, 296–2240 arcs, upper bound on treewidth 14–103.
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:c2ade168-0b55-4ef2-bfb9-75162227ae1f
en
CC BY-NC-SA 3.0