uuid;653d9ff7-3602-4db1-be71-44dca76a04fa.tgz (259.36 MB)

Network instance Chordal, fixed treewidth, edition 1

Download (259.36 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
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 130 graphs on 214–3125 nodes, 22788–637009 arcs, treewidth 211. Parent item: Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2012)] 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