uuid;2e13b48d-01a6-40bc-8807-3abddf6ee332.tgz (2.02 MB)

Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Scale-free; varying vertex count, bounded induced width (Figure 4)

Download (2.02 MB)
dataset
posted on 15.03.2011 by L.R.(Léon) Planken, M.M.(Mathijs) de Weerdt, R.P.J.(Roman) van der Krogt
Scale-free graphs generated following the Barabási-Albert method, then selected for induced width. 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 426 graphs on 100–200 nodes, 460–891 arcs, upper bound on treewidth 38–58. Parent item: Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2011)]

History

Contributors

TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group; University College Cork; Cork Constraint Computations Centre

Publisher

TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group

Format

DIMACS graph format allowing infinite arc weights media types: application/x-gzip

Exports