208 citations · 209 across the 2 of their papers we have counts for
1 paper · 1 filter
Till Fluschnik, Marco Morik, Manuel Sorge
We study the computational complexity of routing multiple objects through a network in such a way that only few collisions occur: Given a graph G with two distinct terminal verti…