GAIKWAD, AJINKYA; MAITY, SOUMEN
(Springer Nature, 2022-03)
Given a graph G=(V,E), a threshold function t : V→N and an integer k, we study the HARMLESS SET problem, where the goal is to find a subset of vertices S⊆V of size at least k such that every vertex v in V has less than ...