An efficient algorithm for approximate betweenness centrality computation.

Mostafa Haghir Chehreghani


Anthology ID:DBLP:conf/cikm/Chehreghani13
Volume:22nd ACM International Conference on Information and Knowledge Management, CIKM'13, San Francisco, CA, USA, October 27 - November 1, 2013
Year:2013
Venue:International Conference on Information and Knowledge Management (CIKM)
Publisher:ACM
Pages:1489-1492
URL:https://doi.org/10.1145/2505515.2507826
DOI:https://doi.org/10.1145/2505515.2507826
DBLP:conf/cikm/Chehreghani13
BibTeX:
@inproceedings{chehreghani-2013-efficient, author = {Mostafa Haghir Chehreghani}, editor = {Qi He and Arun Iyengar and Wolfgang Nejdl and Jian Pei and Rajeev Rastogi}, title = {{An efficient algorithm for approximate betweenness centrality computation}}, booktitle = {{22nd ACM International Conference on Information and Knowledge Management, CIKM'13, San Francisco, CA, USA, October 27 - November 1, 2013}}, pages = {1489--1492}, publisher = {ACM}, year = {2013}, url = {https://doi.org/10.1145/2505515.2507826}, doi = {https://doi.org/10.1145/2505515.2507826} }