On the Complexity of Target Set Selection in Simple Geometric Networks

We study the following model of disease spread in a social network. At first, all individuals are either infected or healthy. Next, in discrete rounds, the disease spreads in the network from infected to healthy individuals such that a healthy individual gets infected if and only if a sufficient num...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete mathematics and theoretical computer science Jg. 26:2; H. Discrete Algorithms
Hauptverfasser:	Dvořák, Michal, Knop, Dušan, Schierreich, Šimon
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Discrete Mathematics & Theoretical Computer Science 21.08.2024
Schlagworte:	computer science - computational complexity
ISSN:	1365-8050, 1365-8050
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!