Cargando…
Estimation and update of betweenness centrality with progressive algorithm and shortest paths approximation
Betweenness centrality is one of the key measures of the node importance in a network. However, it is computationally intractable to calculate the exact betweenness centrality of nodes in large-scale networks. To solve this problem, we present an efficient CBCA (Centroids based Betweenness Centralit...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Nature Publishing Group UK
2023
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10564764/ https://www.ncbi.nlm.nih.gov/pubmed/37816806 http://dx.doi.org/10.1038/s41598-023-44392-0 |