Comment on “Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality" TeX Export

@article{Zhou2006, 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.}, archivePrefix = {arXiv}, author = {Zhou, Tao and Liu, Jian-Guo and Wang, Bing-Hong}, citeulike-article-id = {4294307}, citeulike-linkout-0 = {http://arxiv.org/abs/physics/0511084}, citeulike-linkout-1 = {http://arxiv.org/pdf/physics/0511084}, day = {18}, eprint = {physics/0511084}, keywords = {betweenness\_centrality}, month = {Dec}, posted-at = {2009-04-09 12:38:05}, priority = {0}, title = {Comment on ``Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality"}, url = {http://arxiv.org/abs/physics/0511084}, year = {2005} }

TY - JOUR ID - Zhou2006 L3 - citeulike-article-id:4294307 N2 - 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. TI - Comment on ``Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality" KW - betweenness_centrality AU - Zhou, Tao AU - Liu, Jian-Guo AU - Wang, Bing-Hong PY - 2005/Dec/18/ UR - http://arxiv.org/abs/physics/0511084 ER -