@misc{https://doi.org/10.4121/uuid:2e13b48d-01a6-40bc-8807-3abddf6ee332,
  doi = {10.4121/uuid:2e13b48d-01a6-40bc-8807-3abddf6ee332},
  url = {https://data.4tu.nl/articles/dataset/Benchmark_instances_for_experiments_in_Computing_all-pairs_shortest_paths_by_leveraging_low_treewidth_-_Scale-free_varying_vertex_count_bounded_induced_width_Figure_4_/12687575/1},
  author = {Planken, L.R.(Léon) and de Weerdt, Mathijs and van der Krogt, R.P.J.(Roman)},
  keywords = {APSP, all-pairs shortest paths, STN, simple temporal network, STP, simple temporal problem, shortest path},
  title = {Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Scale-free; varying vertex count, bounded induced width (Figure 4)},
  publisher = {TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group},
  year = {2011},
  copyright = {CC BY-NC-SA 3.0},
}