A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs

Given an n -vertex digraph D and a non-negative integer k , the M inimum D irected B isection problem asks if the vertices of D can be partitioned into two parts, say L and R , such that | L | and | R | differ by at most 1 and the number of arcs from R to L is at most k . This problem is known to be...

Celý popis