Fast computing betweenness centrality with virtual nodes on large sparse networks.
Betweenness centrality is an essential index for analysis of complex networks. However, the calculation of betweenness centrality is quite time-consuming and the fastest known algorithm uses O(N(M + N log N)) time and O(N + M) space for weighted networks, where N and M are the number of nodes and ed...
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
Public Library of Science (PLoS)
2011
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/c4e426ed314c4748bdc5a10617296591 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|