Network instance Scale-free; varying vertex count, bounded induced width, edition 2

Datacite citation style:
Planken, L.R.(Léon); de Weerdt, Mathijs; van der Krogt, R.P.J.(Roman) (2012): Network instance Scale-free; varying vertex count, bounded induced width, edition 2. Version 1. 4TU.ResearchData. dataset. https://doi.org/10.4121/uuid:5f6da46b-e2a2-4e05-a6cb-f22447393fb2
Other citation styles (APA, Harvard, MLA, Vancouver, Chicago, IEEE) available at Datacite
Dataset
Scale-free graphs generated following the Barabási-Albert method, then selected for induced width. 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 160 graphs on 250–1000 vertices, 2176–3330 edges, upper bound on treewidth 150–200. The scale-free density parameter for this selection is 3–15. Parent item: Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2012)]
history
  • 2012-03-09 first online, published, posted
publisher
TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group
format
DIMACS graph format allowing infinite arc weights media types: application/x-gzip
organizations
TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group;
University College Cork; Cork Constraint Computations Centre

DATA

files (1)