On Structural Parameterizations of the Harmless Set Problem

A Gaikwad, S Maity - Algorithmica, 2024 - Springer
In this paper, we study the Harmless Set problem from a parameterized complexity
perspective. Given a graph G=(V, E), a threshold function t: V→ N and an integer k, we study …