10.4121/uuid:c2ade168-0b55-4ef2-bfb9-75162227ae1f
L.R.(Léon) Planken
L.R.(Léon)
Planken
Mathijs de Weerdt
Mathijs
de Weerdt
0000-0002-0470-6241
R.P.J.(Roman) van der Krogt
R.P.J.(Roman)
van der Krogt
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Scale-free; constant vertex count, varying density (Figure 3)
TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group
2011
Dataset
Computation Theory and Mathematics
APSP, all-pairs shortest paths
STN, simple temporal network
STP, simple temporal problem
shortest path
TU Delft - Delft University of Technology
Faculty EEMCS
Algorithmics group
University College Cork
Cork Constraint Computations Centre
2011-03-15
https://doi.org/10.1103/RevModPhys.74.47
http://aaai.org/ocs/index.php/ICAPS/ICAPS11/paper/view/2700
DIMACS graph format allowing infinite arc weights
media types: application/x-gzip
1
CC BY-NC-SA 3.0
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)]