cff-version: 1.2.0
abstract: "STNs randomly generated from the SMT-LIB "diamonds" benchmark. The files from SMT-LIB 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 504 graphs on 51–379 nodes, 49–379 arcs, upper bound on treewidth 2.
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" - Diamonds (Figure 5)"
keywords:
version: 1
identifiers:
  - type: doi
    value: 10.4121/uuid:88fd82f1-febe-4797-b97a-e4ee0306fa48
license: CC BY-NC-SA 3.0
date-released: 2011-03-15