Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2011)]
Datacite citation style:
Planken, L.R.(Léon); de Weerdt, Mathijs; van der Krogt, R.P.J.(Roman) (2011): Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2011)]. Version 1. 4TU.ResearchData. collection. https://doi.org/10.4121/uuid:698db457-499f-48a1-bb26-5a54070b4dbe
Other citation styles (APA, Harvard, MLA, Vancouver, Chicago, IEEE) available at Datacite
Collection
usage stats
243
views
categories
Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2011)]
history
- 2011-03-15 first online, published, posted
- 2020-07-28 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] Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - New York (Figure 6)
- [dataset] Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Chordal, fixed size (Figure 1)
- [dataset] Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Diamonds (Figure 5)
- [dataset] Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Job shop (Figure 7)
- [dataset] Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - HTN (Figure 8)
- [dataset] Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Scale-free; constant vertex count, varying density (Figure 3)
- [dataset] Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Scale-free; varying vertex count, bounded induced width (Figure 4)
- [dataset] Network instance Chordal, fixed treewidth, edition 1
