Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem
Argyrios Deligkas, Eduard Eiben, Gregory Gutin, Philip R. Neary and, Anders Yeo
TL;DR
This paper introduces the Maximum Weighted Digraph Partition problem, establishing complexity classifications across various digraph types and demonstrating applications in game theory and graph problems.
Contribution
It provides the first complexity dichotomies for MWDP on different digraph classes and links these results to applications in game theory and graph theory.
Findings
Complexity dichotomies established for MWDP on various digraphs
Applications demonstrated in binary-action polymatrix games
Revealed connections to classical graph problems
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Defense, Military, and Policy Studies