Network instance Chordal, fixed size, edition 2



Chordal graphs from a self-written generator. 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 250 graphs on 1000 vertices, 75840–499490 edges, treewidth 79–995. Parent item: Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2012)
Date made available9 Mar 2012
PublisherTU Delft - 4TU.ResearchData
Date of data production9 Mar 2012 - 25 Jul 2020

Cite this