Finding the probability of infection in an SIR network is NP-hard (Q1926503)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding the probability of infection in an SIR network is NP-hard |
scientific article |
Statements
Finding the probability of infection in an SIR network is NP-hard (English)
0 references
28 December 2012
0 references
epidemics
0 references
SIR networks
0 references
contact network
0 references
network reliability
0 references
NP-hard
0 references
0 references
0 references
0 references
0 references