Cargando…

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 [Image: see text] time and [Image: see text] space for weighted networks, where [Image: see text] and [Image:...

Descripción completa

Detalles Bibliográficos
Autores principales: Yang, Jing, Chen, Yingwu
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2011
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3144890/
https://www.ncbi.nlm.nih.gov/pubmed/21818337
http://dx.doi.org/10.1371/journal.pone.0022557

Ejemplares similares