On the parameterized complexity of 2-partitions

Jonas Bamse Andersen, Jørgen Bang-Jensen, Anders Yeo

We give an FPT algorithm for deciding whether the vertex set a digraph $D$ can be partitioned into two disjoint sets $V_1,V_2$ such that the digraph $D[V_1]$ induced by $V_1$ has a…