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



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)]
Date made available2012
PublisherTU Delft - 4TU.ResearchData
Date of data production3 Sep 2012 - 23 Jul 2020

Cite this