Found results (16):

STP algorithms and experimentation (software), version 2012-03-public
Posted on 2012-03-13T00:00:00
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - HTN (Figure 8)
Posted on 2011-03-15T00:00:00
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Job shop (Figure 7)
Posted on 2011-03-15T00:00:00
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Diamonds (Figure 5)
Posted on 2011-03-15T00:00:00
Network instance Scale-free; varying vertex count, bounded induced width, edition 2
Posted on 2012-03-09T00:00:00
Network instance New York, edition 2
Posted on 2012-03-09T00:00:00
Network instance Diamonds, edition 2
Posted on 2012-03-09T00:00:00
Network instance Chordal, fixed treewidth, edition 1
Posted on 2011-03-15T00:00:00
Network instance Job shop, edition 2
Posted on 2012-03-09T00:00:00
Network instance HTN, edition 2
Posted on 2012-03-09T00:00:00
Network instance Scale-free; constant vertex count, varying density, edition 2
Posted on 2012-03-09T00:00:00
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Scale-free; constant vertex count, varying density (Figure 3)
Posted on 2011-03-15T00:00:00
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Chordal, fixed size (Figure 1)
Posted on 2011-03-15T00:00:00
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - New York (Figure 6)
Posted on 2011-03-15T00:00:00
Network instance Chordal, fixed size, edition 2
Posted on 2012-03-09T00:00:00
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Scale-free; varying vertex count, bounded induced width (Figure 4)
Posted on 2011-03-15T00:00:00