uuid;413dcbe0-99f1-4f27-a8c0-28b529c0a6d9.tgz (47.98 MB)

Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Chordal, fixed size (Figure 1)

Download (47.98 MB)
dataset
posted on 15.03.2011, 00:00 by L.R.(Léon) Planken, M.M.(Mathijs) de Weerdt, R.P.J.(Roman) van der Krogt
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)]

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