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 250 graphs on 1000 vertices, 75840–499490 edges, treewidth 79–995.
Parent item:
Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2012)]"
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: "Network instance Chordal, fixed size, edition 2"
keywords:
version: 1
identifiers:
  - type: doi
    value: 10.4121/uuid:fea4f033-6bc1-46d8-81f4-d17115304fdb
license: CC BY-NC-SA 3.0
date-released: 2012-03-09