@misc{https://doi.org/10.4121/uuid:5f6da46b-e2a2-4e05-a6cb-f22447393fb2,
  doi = {10.4121/uuid:5f6da46b-e2a2-4e05-a6cb-f22447393fb2},
  url = {https://data.4tu.nl/articles/dataset/Network_instance_Scale-free_varying_vertex_count_bounded_induced_width_edition_2/12696905/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; varying vertex count, bounded induced width, edition 2},
  publisher = {TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group},
  year = {2012},
  copyright = {CC BY-NC-SA 3.0},
}