On Structural Parameterizations of the Harmless Set Problem
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 …
perspective. Given a graph G=(V, E), a threshold function t: V→ N and an integer k, we study …
Immunization in the Threshold Model: A Parameterized Complexity Study
We consider the problem of keeping under control the spread of harmful items in networks,
such as the contagion proliferation of diseases or the diffusion of fake news. We assume the …
such as the contagion proliferation of diseases or the diffusion of fake news. We assume the …
Solving Target Set Selection with Bounded Thresholds Faster than
I Bliznets, D Sagunov - Algorithmica, 2023 - Springer
In this paper we consider the Target Set Selection problem. The problem naturally arises in
many fields like economy, sociology, medicine. In the Target Set Selection problem one is …
many fields like economy, sociology, medicine. In the Target Set Selection problem one is …
Establishing Herd Immunity is Hard Even in Simple Geometric Networks
M Dvořák, D Knop, Š Schierreich - … on Algorithms and Models for the Web …, 2023 - Springer
We study the following model of disease spread in a social network. In the beginning, all
individuals are either infected or healthy. Next, in discrete rounds, the disease spreads in the …
individuals are either infected or healthy. Next, in discrete rounds, the disease spreads in the …
Parameterized Complexity of Weighted Target Set Selection
T Suzuki, K Kimura, A Suzuki, Y Tamura… - Annual Conference on …, 2024 - Springer
Consider a graph G where each vertex has a threshold. A vertex v in G is activated if the
number of active vertices adjacent to v is at least as many as its threshold. A vertex subset A …
number of active vertices adjacent to v is at least as many as its threshold. A vertex subset A …
Check for updates
T Suzuki¹, K Kimura, A Suzuki¹… - … and Applications of …, 2024 - books.google.com
Consider a graph G where each vertex has a threshold. A vertex v in G is activated if the
number of active vertices adjacent to v is at least as many as its threshold. A vertex subset A …
number of active vertices adjacent to v is at least as many as its threshold. A vertex subset A …