Pages that link to "Item:Q1926503"
From MaRDI portal
The following pages link to Finding the probability of infection in an SIR network is NP-hard (Q1926503):
Displaying 8 items.
- A covering-graph approach to epidemics on SIS and SIS-like networks (Q417336) (← links)
- FastSIR algorithm: a fast algorithm for the simulation of the epidemic spread in large networks by using the susceptible-infected-recovered compartment model (Q497122) (← links)
- Stochastic descriptors in an SIR epidemic model for heterogeneous individuals in small networks (Q899593) (← links)
- Computational complexity of impact size estimation for spreading processes on networks (Q977764) (← links)
- Approximations of the generalized cascade model (Q2859422) (← links)
- Approximating individual risk of infection in a Markov chain epidemic network model with a deterministic system (Q2964221) (← links)
- Complexity among combinatorial problems from epidemics (Q4608259) (← links)
- Hardness Results for Seeding Complex Contagion with Neighborhoods (Q5050309) (← links)