@misc{https://doi.org/10.4121/uuid:c2ade168-0b55-4ef2-bfb9-75162227ae1f,
  doi = {10.4121/uuid:c2ade168-0b55-4ef2-bfb9-75162227ae1f},
  url = {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},
  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; constant vertex count, varying density (Figure 3)},
  publisher = {TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group},
  year = {2011},
  copyright = {CC BY-NC-SA 3.0},
}