Harmless Sets in Sparse Classes

TL;DR

This paper studies the computational complexity of the HARMLESS SET problem in sparse graph classes, showing it is fixed-parameter tractable on planar graphs but W[1]-hard when parameterized by treewidth.

Contribution

It proves HARMLESS SET is FPT on planar graphs and admits polynomial kernels, but is W[1]-hard when parameterized by treewidth, answering two open questions.

Findings

HARMLESS SET is FPT on planar graphs.

HARMLESS SET admits a polynomial kernel.

HARMLESS SET is W[1]-hard when parameterized by treewidth.

Abstract

In the classic TARGET SAT SELECTION problem, we are asked to minimise the number of nodes to activate so that, after the application of a certain propagation process, all nodes of the graph are active. Bazgan and Chopin [Discrete Optimization}, 14:170--182, 2014] introduced the opposite problem, named HARMLESS SET, in which they ask to maximise the number of nodes to activate such that not a single additional node is activated. In this paper we investigate how sparsity impacts the tractability of HARMLESS SET. Specifically, we answer two open questions posed by the aforementioned authors, namely a) whether the problem is FPT on planar graphs and b) whether it is FPT parametrised by treewidth. The first question can be answered in the positive using existing meta-theorems on sparse classes, and we further show that HARMLESS SET not only admits a polynomial kernel, but that it can be solved in subexponential time. We then answer the second question in the negative by showing that the problem is W[1]-hard when parametrised by a parameter that upper bounds treewidth.