On Structural Parameterizations of the Offensive Alliance Problem
This provides theoretical insights for researchers in parameterized complexity and graph theory, but it is incremental as it builds on existing hardness results.
The paper tackled the Offensive Alliance problem by analyzing its parameterized complexity with structural graph parameters, showing it is W[1]-hard for parameters like treewidth and feedback vertex set number.
The Offensive Alliance problem has been studied extensively during the last twenty years. A set $S\subseteq V$ of vertices is an offensive alliance in an undirected graph $G=(V,E)$ if each $v\in N(S)$ has at least as many neighbours in $S$ as it has neighbours (including itself) not in $S$. We study the parameterized 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 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.