arXiv · physics/0511084
Comment on ``Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality"
Abstract
In this comment, we investigate a common used algorithm proposed by Newman [M. E. J. Newman, Phys. Rev. E {\bf 64}, 016132(2001)] to calculate the betweenness centrality for all vertices. The inaccurateness of Newman's algorithm is pointed out and a corrected algorithm, also with O($MN$) time complexity, is given. In addition, the comparison of calculating results for these two algorithm aiming the protein interaction network of Yeast is shown.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Tao Zhou, Jian-Guo Liu, Bing-Hong Wang. 2005-12-18. Comment on ``Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality". https://doi.org/10.1088/0256-307x%2F23%2F8%2F099
Cite the original work for its findings. Save a collection to share your selection of sources.