cff-version: 1.2.0
abstract: "Scale-free graphs generated following the Barabási-Albert method with 1000 vertices and density parameter varying from 2 to 80. 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 130 graphs on 1000 vertices, 1996–67360 edges, upper bound on treewidth 88–864.
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 Scale-free; constant vertex count, varying density, edition 2"
keywords:
version: 1
identifiers:
- type: doi
value: 10.4121/uuid:db232a00-6f0b-4df3-b56e-ade64077968c
license: CC BY-NC-SA 3.0
date-released: 2012-03-09