A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Heuristic Algorithm for Approximation Betweenness Centrality Using Graph Coarsening
2015
Procedia Computer Science
Nowadays, graph analytics are widely used in many research fields and applications. One important analytic that measures the influence of each vertex on flows through the network, is the betweenness centrality. It is used to analyze real-world networks like for example social networks and networks in computational biology. Unfortunately this centrality metric is rather expensive to compute and there is a number of studies devoted to approximate it. Here we focus on approximating the computation
doi:10.1016/j.procs.2015.11.011
fatcat:mwhtka25fbfjpj2nkhgtjneqxq