Planken, L.R.(Léon)
de Weerdt, Mathijs
van der Krogt, R.P.J.(Roman)
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Scale-free; constant vertex count, varying density (Figure 3)
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)]
en
APSP, all-pairs shortest paths
STN, simple temporal network
STP, simple temporal problem
shortest path
2011
https://doi.org/10.4121/uuid:c2ade168-0b55-4ef2-bfb9-75162227ae1f

10.4121/uuid:c2ade168-0b55-4ef2-bfb9-75162227ae1f