On Structural Parameterizations of the Offensive Alliance Problem

by   Ajinkya Gaikwad, et al.

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 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.



There are no comments yet.


page 1

page 2

page 3

page 4


Defensive Alliances in Graphs

A set S of vertices of a graph is a defensive alliance if, for each elem...

The Harmless Set Problem

Given a graph G = (V,E), a threshold function t  :  V →ℕ and an integer ...

The Satisfactory Partition Problem

The Satisfactory Partition problem consists in deciding if the set of ve...

The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph

Let G=(V,A) be a vertex-colored arc-weighted directed acyclic graph (DAG...

Structural Parameterizations of Tracking Paths Problem

Given a graph G with source and destination vertices s,t∈ V(G) respectiv...

Neural reparameterization improves structural optimization

Structural optimization is a popular method for designing objects such a...

The Parameterized Complexity of Welfare Guarantees in Schelling Segregation

Schelling's model considers k types of agents each of whom needs to sele...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.