@misc{https://doi.org/10.4121/uuid:6cad8a1b-88db-4a64-97eb-b4f3f1a87047,
  doi = {10.4121/uuid:6cad8a1b-88db-4a64-97eb-b4f3f1a87047},
  url = {https://data.4tu.nl/articles/dataset/Network_instance_Diamonds_edition_2/12703142/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 Diamonds, edition 2},
  publisher = {TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group},
  year = {2012},
  copyright = {CC BY-NC-SA 3.0},
}