2 citations · 9 across the 18 of their papers we have counts for
1 paper · 2 filters
Matthias Bentert, Klaus Heeger, Dušan Knop
In the presented paper we study the Length-Bounded Cut problem for special graph classes as well as from a parameterized-complexity viewpoint. Here, we are given a graph G, two v…