The Satisfactory Partition Problem

07/28/2020
by   Ajinkya Gaikwad, et al.
0

The Satisfactory Partition problem consists in deciding if the set of vertices of a given undirected graph can be partitioned into two nonempty parts such that each vertex has at least as many neighbours in its part as in the other part. This problem was introduced by Gerber and Kobler [European J. Oper. Res. 125 (2000) 283-291] and further studied by other authors, but its parameterized complexity remains open until now. It is known that the Satisfactory Partition problem, as well as a variant where the parts are required to be of the same cardinality, are NP-complete. We enhance our understanding of the problem from the viewpoint of parameterized complexity by showing that (1) the problem is FPT when parameterized by the neighbourhood diversity of the input graph, (2) it can be solved in O(n^8 cw) where cw is the clique-width,(3) a generalized version of the problem is W[1]-hard when parameterized by the treewidth.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/04/2022

Globally Minimal Defensive Alliances: A Parameterized Perspective

A defensive alliance in an undirected graph G=(V,E) is a non-empty set o...
research
10/29/2021

On Structural Parameterizations of the Offensive Alliance Problem

The Offensive Alliance problem has been studied extensively during the l...
research
09/14/2021

The Complexity of Vector Partition

We consider the vector partition problem, where n agents, each with a d-...
research
01/27/2019

Parameterized Complexity of Safe Set

In this paper we study the problem of finding a small safe set S in a gr...
research
08/05/2022

Offensive Alliances in Graphs

A set S⊆ V of vertices is an offensive alliance in an undirected graph G...
research
11/30/2020

Homology Localization Through the Looking-Glass of Parameterized Complexity Theory

Finding a cycle of lowest weight that represents a homology class in a s...
research
08/21/2023

Parameterized Complexity of Fair Bisection: FPT-Approximation meets Unbreakability

In the Minimum Bisection problem, input is a graph G and the goal is to ...

Please sign up or login with your details

Forgot password? Click here to reset