Cargando…
Finding Near-Optimal Groups of Epidemic Spreaders in a Complex Network
In this paper, we present algorithms to find near-optimal sets of epidemic spreaders in complex networks. We extend the notion of local-centrality, a centrality measure previously shown to correspond with a node's ability to spread an epidemic, to sets of nodes by introducing combinatorial loca...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2014
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3973667/ https://www.ncbi.nlm.nih.gov/pubmed/24694693 http://dx.doi.org/10.1371/journal.pone.0090303 |