Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem

07/03/2023

∙

by   Argyrios Deligkas, et al.

∙

0

∙

share

We introduce and study a new optimization problem on digraphs, termed Maximum Weighted Digraph Partition (MWDP) problem. We prove three complexity dichotomies for MWDP: on arbitrary digraphs, on oriented digraphs, and on symmetric digraphs. We demonstrate applications of the dichotomies for binary-action polymatrix games and several graph theory problems.