TY - DATA
T1 - Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Scale-free; constant vertex count, varying density (Figure 3)
PY - 2011/03/15
AU - L.R.(Léon) Planken
AU - Mathijs de Weerdt
AU - R.P.J.(Roman) van der Krogt
UR - https://data.4tu.nl/articles/dataset/Benchmark_instances_for_experiments_in_Computing_all-pairs_shortest_paths_by_leveraging_low_treewidth_-_Scale-free_constant_vertex_count_varying_density_Figure_3_/12714470/1
DO - 10.4121/uuid:c2ade168-0b55-4ef2-bfb9-75162227ae1f
KW - APSP, all-pairs shortest paths
KW - STN, simple temporal network
KW - STP, simple temporal problem
KW - shortest path
N2 - Scale-free graphs generated following the Barabási-Albert method with 150 vertices and density parameter varying from 2 to 20. 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 190 graphs on 150 nodes, 296–2240 arcs, upper bound on treewidth 14–103.
Parent item:
Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2011)]
ER -