Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem

Argyrios Deligkas,Eduard Eiben,Gregory Gutin,Philip R. Neary,Anders Yeo

CoRR（2023）

引用 0|浏览12

暂无评分

摘要

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.

查看译文

关键词

maximum weighted digraph partition,complexity dichotomies

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要