Parameterized complexity of locally minimal defensive alliances

Abstract

A set S of vertices of a graph is a defensive alliance if, for each element of S, the majority of its neighbours is in S. We consider the notion of local minimality in this paper. We are interested in locally minimal defensive alliance of maximum size. This problem is known to be NP-hard but its parameterized complexity remains open until now. We enhance our understanding of the problem from the viewpoint of parameterized complexity. The main results of the paper are the following: (1) LOCALLY MINIMAL DEFENSIVE ALLIANCE is NP-complete, even when restricted to planar graphs, (2) a randomized FPT algorithm for EXACT CONNECTED LOCALLY MINIMAL DEFENSIVE ALLIANCE parameterized by solution size, (3) LOCALLY MINIMAL DEFENSIVE ALLIANCE is fixed-parameter tractable (FPT) when parameterized by neighbourhood diversity, (4) LOCALLY MINIMAL DEFENSIVE ALLIANCE parameterized by treewidth is W[1]-hard and thus not FPT (unless FPT=W[1]), (5) LOCALLY MINIMAL DEFENSIVE ALLIANCE can be solved in polynomial time for graphs of bounded treewidth.