Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2012)]
Datacite citation style:
Planken, L.R.(Léon); de Weerdt, Mathijs; van der Krogt, R.P.J.(Roman) (2012): Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2012)]. Version 1. 4TU.ResearchData. collection. https://doi.org/10.4121/uuid:49388c35-c7fb-464f-9293-cca1406edccf
Other citation styles (APA, Harvard, MLA, Vancouver, Chicago, IEEE) available at Datacite
Collection
usage stats
411
views
1
citations
categories
Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2012)]
history
- 2012-03-09 first online, published, posted
- 2020-07-17 revised
publisher
TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group
references
organizations
TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group;University College Cork; Cork Constraint Computations Centre
DATASETS
- [dataset] Network instance Chordal, fixed size, edition 2
- [dataset] Network instance Chordal, fixed treewidth, edition 1
- [dataset] Network instance Diamonds, edition 2
- [dataset] Network instance HTN, edition 2
- [dataset] Network instance Job shop, edition 2
- [dataset] Network instance New York, edition 2
- [dataset] Network instance Scale-free; varying vertex count, bounded induced width, edition 2
- [dataset] Network instance Scale-free; constant vertex count, varying density, edition 2