TY - GEN
T1 - Heuristics for speeding up betweenness centrality computation
AU - Puzis, Rami
AU - Zilberman, Polina
AU - Elovici, Yuval
AU - Dolev, Shlomi
AU - Brandes, Ulrik
PY - 2012/12/1
Y1 - 2012/12/1
N2 - We propose and evaluate two complementary heuristics to speed up exact computation of the shortest-path between ness centrality. Both heuristics are relatively simple adaptations of the standard algorithm for between ness centrality. Consequently, they generalize the computation of edge between ness and most other variants, and can be used to further speed up between ness estimation algorithms, as well. In the first heuristic, structurally equivalent vertices are contracted based on the observation that they have the same centrality and also contribute equally to the centrality of others. In the second heuristic, we first apply a linear-time between ness algorithm on the block-cut point tree and then compute the remaining contributions separately in each biconnected component. Experiments on a variety of large graphs illustrate the efficiency and complementarity of our heuristics.
AB - We propose and evaluate two complementary heuristics to speed up exact computation of the shortest-path between ness centrality. Both heuristics are relatively simple adaptations of the standard algorithm for between ness centrality. Consequently, they generalize the computation of edge between ness and most other variants, and can be used to further speed up between ness estimation algorithms, as well. In the first heuristic, structurally equivalent vertices are contracted based on the observation that they have the same centrality and also contribute equally to the centrality of others. In the second heuristic, we first apply a linear-time between ness algorithm on the block-cut point tree and then compute the remaining contributions separately in each biconnected component. Experiments on a variety of large graphs illustrate the efficiency and complementarity of our heuristics.
KW - betweenness
KW - bi-connectivity
KW - speedup heuristics
KW - structural equivalence
UR - http://www.scopus.com/inward/record.url?scp=84873629605&partnerID=8YFLogxK
U2 - 10.1109/SocialCom-PASSAT.2012.66
DO - 10.1109/SocialCom-PASSAT.2012.66
M3 - Conference contribution
AN - SCOPUS:84873629605
SN - 9780769548487
T3 - Proceedings - 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust and 2012 ASE/IEEE International Conference on Social Computing, SocialCom/PASSAT 2012
SP - 302
EP - 311
BT - Proceedings - 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust and 2012 ASE/IEEE International Conference on Social Computing, SocialCom/PASSAT 2012
T2 - 2012 ASE/IEEE International Conference on Social Computing, SocialCom 2012 and the 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2012
Y2 - 3 September 2012 through 5 September 2012
ER -