Cargando…
The generalized influence blocking maximization problem
Given a network N and a set of nodes that are the starting point for the spread of misinformation across N and an integer k, in the influence blocking maximization problem the goal is to find k nodes in N as the starting point for a competing information (say, a correct information) across N such th...
Autores principales: | Erd, Fernando C., Vignatti, André L., Silva, Murilo V. G. da |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Vienna
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8199850/ https://www.ncbi.nlm.nih.gov/pubmed/34149959 http://dx.doi.org/10.1007/s13278-021-00765-9 |
Ejemplares similares
-
Maximizing the Spread of Influence via Generalized Degree Discount
por: Wang, Xiaojie, et al.
Publicado: (2016) -
Solving the influence maximization problem reveals regulatory organization of the yeast cell cycle
por: Gibbs, David L., et al.
Publicado: (2017) -
Maximal Perfect Haplotype Blocks with Wildcards
por: Williams, Lucia, et al.
Publicado: (2020) -
Maximal Clique Based Influence Maximization in Networks
por: Mhadhbi, Nizar, et al.
Publicado: (2020) -
eBLOCKs: enumerating conserved protein blocks to achieve maximal sensitivity and specificity
por: Su, Qiaojuan Jane, et al.
Publicado: (2005)