Cargando…
Improved collective influence of finding most influential nodes based on disjoint-set reinsertion
Identifying vital nodes in complex networks is a critical problem in the field of network theory. To this end, the Collective Influence (CI) algorithm has been introduced and shows high efficiency and scalability in searching for the influential nodes in the optimal percolation model. However, the c...
Autor principal: | Zhu, Fengkuangtian |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6162239/ https://www.ncbi.nlm.nih.gov/pubmed/30266910 http://dx.doi.org/10.1038/s41598-018-32874-5 |
Ejemplares similares
-
Publisher Correction: Improved collective influence of finding most influential nodes based on disjoint-set reinsertion
por: Zhu, Fengkuangtian
Publicado: (2018) -
Canine Algorithm for Node Disjoint Paths
por: Ananthalakshmi Ammal, R., et al.
Publicado: (2020) -
Disjoint Paired-Dominating sets in Cubic Graphs
por: Bacsó, Gábor, et al.
Publicado: (2019) -
Integrated Value of Influence: An Integrative Method for the Identification of the Most Influential Nodes within Networks
por: Salavaty, Abbas, et al.
Publicado: (2020) -
Inverses of disjointness preving operators
por: Abramovich, YA, et al.
Publicado: (1999)