+ helpreset results/page
15 items found
Active filters: x Type: Dataset x Collection: STP algorithms and i... x Data format: application/x-gzip [remove all]
Filter:
Type #2
15Item with a doi
Creator
15Planken, L.R.(Léon)
15de Weerdt, M.M.(Mathijs)
15van der Krogt, R.P.J.(Roman)
Year
72012
82011
Subject
15Computation Theory and Mathematics
results 1-15
Network instance Scale-free; varying vertex count, bounded induced width, edition 2Dataset2012Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Network instance Scale-free; constant vertex count, varying density, edition 2Dataset2012Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Network instance New York, edition 2Dataset2012Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Network instance Job shop, edition 2Dataset2012Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Network instance HTN, edition 2Dataset2012Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Network instance Diamonds, edition 2Dataset2012Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Network instance Chordal, fixed size, edition 2Dataset2012Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - HTN (Figure 8)Dataset2011Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Job shop (Figure 7)Dataset2011Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - New York (Figure 6)Dataset2011Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Diamonds (Figure 5)Dataset2011Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Scale-free; varying vertex count, bounded induced width (Figure 4)Dataset2011Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Scale-free; constant vertex count, varying density (Figure 3)Dataset2011Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Network instance Chordal, fixed treewidth, edition 1Dataset2011Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Chordal, fixed size (Figure 1)Dataset2011Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)