cff-version: 1.2.0
abstract: "Scale-free graphs generated following the Barabási-Albert method with 150 vertices and density parameter varying from 2 to 20. 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 190 graphs on 150 nodes, 296–2240 arcs, upper bound on treewidth 14–103.
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" - Scale-free; constant vertex count, varying density (Figure 3)"
keywords:
version: 1
identifiers:
  - type: doi
    value: 10.4121/uuid:c2ade168-0b55-4ef2-bfb9-75162227ae1f
license: CC BY-NC-SA 3.0
date-released: 2011-03-15