On Structural Parameterizations of Firefighting

11/28/2017
by   Bireswar Das, et al.
0

The Firefighting problem is defined as follows. At time t=0, a fire breaks out at a vertex of a graph. At each time step t ≥ 0, a firefighter permanently defends (protects) an unburned vertex, and the fire then spread to all undefended neighbors from the vertices on fire. This process stops when the fire cannot spread anymore. The goal is to find a sequence of vertices for the firefighter that maximizes the number of saved (non burned) vertices. The Firefighting problem turns out to be NP-hard even when restricted to bipartite graphs or trees of maximum degree three. We study the parameterized complexity of the Firefighting problem for various structural parameterizations. All our parameters measure the distance to a graph class (in terms of vertex deletion) on which the firefighting problem admits a polynomial time algorithm. Specifically, for a graph class F and a graph G, a vertex subset S is called a modulator to F if G ∖ S belongs to F. The parameters we consider are the sizes of modulators to graph classes such as threshold graphs, bounded diameter graphs, disjoint unions of stars, and split graphs. To begin with, we show that the problem is W[1]-hard when parameterized by the size of a modulator to diameter at most two graphs and split graphs. In contrast to the above intractability results, we show that Firefighting is fixed parameter tractable (FPT) when parameterized by the size of a modulator to threshold graphs and disjoint unions of stars, which are subclasses of diameter at most two graphs. We further investigate the kernelization complexity of these problems to find that firefighting admits a polynomial kernel when parameterized by the size of a modulator to a clique, while it is unlikely to admit a polynomial kernel when parameterized by the size of a modulator to a disjoint union of stars.

READ FULL TEXT
research
11/11/2021

The Harmless Set Problem

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

When Maximum Stable Set can be solved in FPT time

Maximum Independent Set (MIS for short) is in general graphs the paradig...
research
01/11/2019

On Kernelization for Edge Dominating Set under Structural Parameters

In the NP-hard Edge Dominating Set problem (EDS) we are given a graph G=...
research
10/24/2019

On the complexity of colouring antiprismatic graphs

A graph G is prismatic if for every triangle T of G, every vertex of G n...
research
10/12/2020

Graph Square Roots of Small Distance from Degree One Graphs

Given a graph class ℋ, the task of the ℋ-Square Root problem is to decid...
research
08/27/2018

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around

A fundamental graph problem is to recognize whether the vertex set of a ...
research
08/10/2018

The Power of Cut-Based Parameters for Computing Edge Disjoint Paths

This paper revisits the classical Edge Disjoint Paths (EDP) problem, whe...

Please sign up or login with your details

Forgot password? Click here to reset