Planken, L.R.(Léon); de Weerdt, Mathijs; van der Krogt, R.P.J.(Roman) (2012): Network instance Chordal, fixed size, edition 2. Version 1. 4TU.ResearchData. dataset. https://doi.org/10.4121/uuid:fea4f033-6bc1-46d8-81f4-d17115304fdb

Dataset

• Computation Theory and Mathematics

APSP, all-pairs shortest paths, shortest path, STN, simple temporal network, STP, simple temporal problem

CC BY-NC-SA 3.0

• Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2012)]

RefWorks, BibTeX, Reference Manager, Endnote, DataCite, NLM, DC, CFF

by L.R.(Léon) Planken , Mathijs de Weerdt , R.P.J.(Roman) van der Krogt

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)]

• 2012-03-09 first online, published, posted

TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group

DIMACS graph format allowing infinite arc weights media types: application/x-gzip

• https://doi.org/10.1613/jair.3509

TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group;
University College Cork; Cork Constraint Computations Centre