Cargando…
Maximal Clique Based Influence Maximization in Networks
Influence maximization is a fundamental problem in several real life applications such as viral marketing, recommendation system, collaboration and social networks. Maximizing influence spreading in a given network aims to find the initially active vertex set of size k called seed nodes (or initial...
Autores principales: | Mhadhbi, Nizar, Raddaoui, Badran |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7274323/ http://dx.doi.org/10.1007/978-3-030-50146-4_33 |
Ejemplares similares
-
Viral Quasispecies Assembly via Maximal Clique Enumeration
por: Töpfer, Armin, et al.
Publicado: (2014) -
CLIMP: Clustering Motifs via Maximal Cliques with Parallel Computing Design
por: Zhang, Shaoqiang, et al.
Publicado: (2016) -
On Finding and Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs
por: Phillips, Charles A., et al.
Publicado: (2019) -
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
por: Lehmann, Katharina A, et al.
Publicado: (2006) -
Influence maximization in Boolean networks
por: Parmer, Thomas, et al.
Publicado: (2022)