cff-version: 1.2.0
abstract: "STNs randomly generated in the SMT-LIB "diamonds" benchmark category. The benchmarks are DTP instances. STNs were generated from these by randomly selecting a literal from each clause. For each STN thus generated, the graph structure was maintained while modifying the weights of the constraint arcs 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 111–2751 vertices, 111–2751 edges, upper bound on treewidth 2.
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 Diamonds, edition 2"
keywords:
version: 1
identifiers:
  - type: doi
    value: 10.4121/uuid:6cad8a1b-88db-4a64-97eb-b4f3f1a87047
license: CC BY-NC-SA 3.0
date-released: 2012-03-09