Comment on ``Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality"
Zhou, Tao · Liu, Jian-Guo · Wang, Bing-Hong
Original · EN
In this comment, we investigate a common used algorithm proposed by Newman [M. E. J. Newman, Phys. Rev. E 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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.