Cargando…
A Novel Top-k Strategy for Influence Maximization in Complex Networks with Community Structure
In complex networks, it is of great theoretical and practical significance to identify a set of critical spreaders which help to control the spreading process. Some classic methods are proposed to identify multiple spreaders. However, they sometimes have limitations for the networks with community s...
Autores principales: | He, Jia-Lin, Fu, Yan, Chen, Duan-Bing |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4689492/ https://www.ncbi.nlm.nih.gov/pubmed/26682706 http://dx.doi.org/10.1371/journal.pone.0145283 |
Ejemplares similares
-
Correction: A Novel Top-k Strategy for Influence Maximization in Complex Networks with Community Structure
por: He, Jia-Lin, et al.
Publicado: (2016) -
Surprise maximization reveals the community structure of complex networks
por: Aldecoa, Rodrigo, et al.
Publicado: (2013) -
Maximal Clique Based Influence Maximization in Networks
por: Mhadhbi, Nizar, et al.
Publicado: (2020) -
Influence maximization in Boolean networks
por: Parmer, Thomas, et al.
Publicado: (2022) -
A Memetic Algorithm for Solving the Robust Influence Maximization Problem on Complex Networks against Structural Failures
por: Huang, Delin, et al.
Publicado: (2022)