58 citations · 151 across the 35 of their papers we have counts for
1 paper · 1 filter
Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk +1
The MULTICUT problem, given a graph G, a set of terminal pairs T={(s_i,t_i) | 1 <= i <= r} and an integer p, asks whether one can find a cutset consisting of at most p non-terminal…