On Structural Parameterizations of the Offensive Alliance Problem

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) not in 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 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.

[1]  Henning Fernau,et al.  Alliances in Graphs: a Complexity-Theoretic Study , 2007, SOFSEM.

[2]  Ma-Lian Chia,et al.  Global defensive alliances of trees and Cartesian product of paths and cycles , 2012, Discret. Appl. Math..

[3]  Juan A. Rodríguez-Velázquez,et al.  On defensive alliances and line graphs , 2006, Appl. Math. Lett..

[4]  Stefan Woltran,et al.  Defensive Alliances in Graphs of Bounded Treewidth , 2018, Discret. Appl. Math..

[5]  Saket Saurabh,et al.  Capacitated Domination and Covering: A Parameterized Perspective , 2008, IWPEC.

[7]  Rosa I. Enciso,et al.  Alliances in graphs: Parameterized algorithms and on partitioning series -parallel graphs , 2009 .

[8]  Juan A. Rodríguez-Velázquez,et al.  On the global offensive alliance number of a graph , 2006, Discret. Appl. Math..

[9]  Jaroslav Nesetril,et al.  Sparsity - Graphs, Structures, and Algorithms , 2012, Algorithms and combinatorics.

[10]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[11]  Teresa W. Haynes,et al.  Global Alliances and Independence in Trees , 2007, Discuss. Math. Graph Theory.

[12]  Michal Pilipczuk,et al.  Parameterized Algorithms , 2015, Springer International Publishing.

[13]  Juan A. Rodríguez-Velázquez,et al.  Offensive r-alliances in graphs , 2009, Discret. Appl. Math..

[14]  Stephen T. Hedetniemi,et al.  Algorithms and complexity for alliances and weighted alliances of various types , 2007 .

[15]  Yota Otachi,et al.  Alliances in graphs of bounded clique-width , 2017, Discret. Appl. Math..

[16]  Robert Ganian,et al.  On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem , 2020, Algorithmica.

[17]  Ajinkya Gaikwad,et al.  Parameterized Complexity of Defensive and Offensive Alliances in Graphs , 2020, ICDCIT.

[18]  Jose Maria Sigarreta,et al.  On the complement graph and defensive k-alliances , 2009, Discret. Appl. Math..

[19]  Paul D. Seymour,et al.  Graph minors. III. Planar tree-width , 1984, J. Comb. Theory B.

[20]  Juan A. Rodríguez-Velázquez,et al.  Global offensive alliances in graphs , 2006, Electron. Notes Discret. Math..