uuid;653d9ff7-3602-4db1-be71-44dca76a04fa.tgz (259.36 MB)
Download fileNetwork instance Chordal, fixed treewidth, edition 1
dataset
posted on 15.03.2011, 00:00 authored by L.R.(Léon) Planken, Mathijs de WeerdtMathijs de Weerdt, R.P.J.(Roman) van der KrogtChordal 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
References
Contributors
TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group; University College Cork; Cork Constraint Computations CentrePublisher
TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics groupFormat
DIMACS graph format allowing infinite arc weights media types: application/x-gzipUsage metrics
Categories
Keywords
APSP, all-pairs shortest pathsCollection: Benchmark instances for experiments in [Computing All-Pairs Shortest Paths by Leveraging Low Treewidth (paper, 2011)]Collection: Benchmark instances for experiments in [Computing All-Pairs Shortest Paths by Leveraging Low Treewidth (paper, 2012)]STN, simple temporal networkSTP, simple temporal problemshortest path