Computing top-k Closeness Centrality Faster in Unweighted Graphs

Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi +2

Given a connected graph $G=(V,E)$, the closeness centrality of a vertex $v$ is defined as $\frac{n-1}{{\sum }_{w\in V}d(v,w)}$. This measure is widely used in the analysis of real-w…