On Structural Parameterizations of the Offensive Alliance Problem

Abstract

The OFFENSIVE ALLIANCE problem has been studied extensively during the last twenty years. A set S⊆V of vertices is an offensive alliance in an undirected graph G=(V,E) if each v∈N(S) has at least as many neighbours in S as it has neighbours (including itself) outside S. We study the parameterzied complexity of the OFFENSIVE ALLIANCE problem, where the aim is to find a minimum size offensive alliance. Our focus here lies on parameters that measure the structural properties of the input instance. We enhance our understanding of the problem from the viewpoint of parameterized complexity by showing that the OFFENSIVE ALLIANCE problem is W[1]-hard parameterized by a wide range of fairly restrictive structural parameters such as the feedback vertex set number, treewidth, pathwidth, and treedepth of the input graph. We also prove that the STRONG OFFENSIVE ALLIANCE problem parameterized by the vertex cover number of the input graph does not admit a polynomial compression unless coNP ⊆ NP/poly