Network instance Chordal, fixed treewidth, edition 1

Datacite citation style:
Planken, L.R.(Léon); de Weerdt, Mathijs; van der Krogt, R.P.J.(Roman) (2011): Network instance Chordal, fixed treewidth, edition 1. Version 1. 4TU.ResearchData. dataset. https://doi.org/10.4121/uuid:653d9ff7-3602-4db1-be71-44dca76a04fa
Other citation styles (APA, Harvard, MLA, Vancouver, Chicago, IEEE) available at Datacite
Dataset
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
  • 2011-03-15 first online, published, posted
publisher
TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group
format
DIMACS graph format allowing infinite arc weights media types: application/x-gzip
organizations
TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group;
University College Cork; Cork Constraint Computations Centre

DATA

files (1)