Heuristics for speeding up betweenness centrality computation

Rami Puzis, Polina Zilberman, Yuval Elovici, Shlomi Dolev, Ulrik Brandes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

24 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust and 2012 ASE/IEEE International Conference on Social Computing, SocialCom/PASSAT 2012
Pages302-311
Number of pages10
DOIs
StatePublished - 1 Dec 2012
Event2012 ASE/IEEE International Conference on Social Computing, SocialCom 2012 and the 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2012 - Amsterdam, Netherlands
Duration: 3 Sep 20125 Sep 2012

Publication series

NameProceedings - 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust and 2012 ASE/IEEE International Conference on Social Computing, SocialCom/PASSAT 2012

Conference

Conference2012 ASE/IEEE International Conference on Social Computing, SocialCom 2012 and the 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2012
Country/TerritoryNetherlands
CityAmsterdam
Period3/09/125/09/12

Keywords

  • betweenness
  • bi-connectivity
  • speedup heuristics
  • structural equivalence

Fingerprint

Dive into the research topics of 'Heuristics for speeding up betweenness centrality computation'. Together they form a unique fingerprint.

Cite this