18 citations · 18 across the 4 of their papers we have counts for
1 paper · 2 filters
Till Fluschnik, Meike Hatzel, Steffen Härtlein +2
We study the NP-hard Minimum Shared Edges (MSE) problem on graphs: decide whether it is possible to route p paths from a start vertex to a target vertex in a given graph while us…