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...

Full description

Bibliographic Details

Published in:	Discrete mathematics and theoretical computer science Vol. 26:2; no. Discrete Algorithms
Main Authors:	Dvořák, Michal, Knop, Dušan, Schierreich, Šimon
Format:	Journal Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 21.08.2024
Subjects:	computer science - computational complexity
ISSN:	1365-8050, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!