Madathil, Jayakrishnan; Sharma, Roohani; Zehavi, Meirav
(Springer, 2021-02)
Given an n-vertex digraph D and a non-negative integer k, the Minimum Directed Bisection problem asks if the vertices of D can be partitioned into two parts, say L and R, such that |L| and |R| difer by at most 1 and the ...