cff-version: 1.2.0
abstract: "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)]"
authors:
  - family-names: Planken
    given-names: L.R.(Léon)
  - family-names: de Weerdt
    given-names: Mathijs
    orcid: "https://orcid.org/0000-0002-0470-6241"
  - family-names: van der Krogt
    given-names: R.P.J.(Roman)
title: "Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Chordal, fixed size (Figure 1)"
keywords:
version: 1
identifiers:
  - type: doi
    value: 10.4121/uuid:413dcbe0-99f1-4f27-a8c0-28b529c0a6d9
license: CC BY-NC-SA 3.0
date-released: 2011-03-15