We introduce and study a new optimization problem on digraphs, termed Maximum
Weighted Digraph Partition (MWDP) problem. We prove three complexity dichotomies for …