@misc{https://doi.org/10.4121/uuid:db232a00-6f0b-4df3-b56e-ade64077968c,
  doi = {10.4121/uuid:db232a00-6f0b-4df3-b56e-ade64077968c},
  url = {https://data.4tu.nl/articles/dataset/Network_instance_Scale-free_constant_vertex_count_varying_density_edition_2/12716681/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 = {Network instance Scale-free; constant vertex count, varying density, edition 2},
  publisher = {TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group},
  year = {2012},
  copyright = {CC BY-NC-SA 3.0},
}