Establishing herd immunity is hard even in simple geometric networks
From MaRDI portal
Publication:6057292
DOI10.1007/978-3-031-32296-9_5arXiv2307.06976OpenAlexW4376608211MaRDI QIDQ6057292
Šimon Schierreich, Dušan Knop, Michal Dvořák
Publication date: 4 October 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2307.06976
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sphere and dot product representations of graphs
- Treewidth governs the complexity of target set selection
- Maximum independent sets in 3- and 4-regular Hamiltonian graphs
- The firefighter problem on graph classes
- The parameterized complexity of editing graphs for bounded degeneracy
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Independent domination in chordal graphs
- Unit disk graphs
- Unit disk graph recognition is NP-hard
- The convexity of induced paths of order three and applications: complexity aspects
- Dynamic monopolies for interval graphs with bounded thresholds
- Some results on the target set selection problem
- Constant thresholds can make target set selection tractable
- Latency-bounded target set selection in social networks
- On Tractable Cases of Target Set Selection
- On the Approximability of Influence in Social Networks
- Universality considerations in VLSI circuits
- The Complexity of Multiterminal Cuts
- Target Set Selection in Dense Graph Classes
- Target Set Selection Parameterized by Clique-Width and Maximum Threshold
- Variants of Spreading Messages
- Representing graphs by disks and balls (a survey of recognition-complexity results)
This page was built for publication: Establishing herd immunity is hard even in simple geometric networks
