most citedOn the minimum number of arcs in -dicritical oriented graphs

2 citations · 4 across the 3 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2022★ 1 cited

On the parameterized complexity of symmetric directed multicut

Eduard Eiben, Clément Rambaud, Magnus Wahlström

We study the problem Symmetric Directed Multicut from a parameterized complexity perspective. In this problem, the input is a digraph , a set of cut requests $C=\{(s_1,t_1),\ldo…