Topology manipulations for speeding betweenness centrality computation

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

PUZIS, Rami, Yuval ELOVICI, Polina ZILBERMAN, Shlomi DOLEV, Ulrik BRANDES, 2015. Topology manipulations for speeding betweenness centrality computation. In: Journal of Complex Networks. 3(1), pp. 84-112. ISSN 2051-1310. eISSN 2051-1329. Available under: doi: 10.1093/comnet/cnu015

@article{Puzis2015Topol-30388, title={Topology manipulations for speeding betweenness centrality computation}, year={2015}, doi={10.1093/comnet/cnu015}, number={1}, volume={3}, issn={2051-1310}, journal={Journal of Complex Networks}, pages={84--112}, author={Puzis, Rami and Elovici, Yuval and Zilberman, Polina and Dolev, Shlomi and Brandes, Ulrik} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dc:language>eng</dc:language> <dcterms:abstract xml:lang="eng">We propose and evaluate two complementary heuristics to speed up exact computation of the shortest-path betweenness centrality (BC). Both heuristics are relatively simple adaptations of the standard algorithm for BC. Consequently, they generalize the computation of edge betweenness and most other variants, and can be used to further speed up betweenness 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 betweenness algorithm on the block-cut-point tree and then compute the remaining contributions separately in each bi-connected component. Experiments on a variety of large graphs illustrate the efficiency and complementarity of our heuristics.</dcterms:abstract> <dc:creator>Brandes, Ulrik</dc:creator> <dc:creator>Dolev, Shlomi</dc:creator> <dc:creator>Puzis, Rami</dc:creator> <dcterms:available rdf:datatype="">2015-03-18T12:58:12Z</dcterms:available> <dc:contributor>Puzis, Rami</dc:contributor> <dc:contributor>Elovici, Yuval</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Brandes, Ulrik</dc:contributor> <dcterms:isPartOf rdf:resource=""/> <bibo:uri rdf:resource=""/> <dc:contributor>Zilberman, Polina</dc:contributor> <dc:date rdf:datatype="">2015-03-18T12:58:12Z</dc:date> <dc:creator>Zilberman, Polina</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:creator>Elovici, Yuval</dc:creator> <dcterms:title>Topology manipulations for speeding betweenness centrality computation</dcterms:title> <dspace:isPartOfCollection rdf:resource=""/> <dcterms:issued>2015</dcterms:issued> <dc:contributor>Dolev, Shlomi</dc:contributor> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


My Account