Skip to main content

Table 2 Normalized distances and normalized number of shortest paths for the blue cluster \(C_{1}\)

From: Fast cluster-based computation of exact betweenness centrality in large graphs

Node v \({\hat{d}}_{C_{1}}(v,b_{1})\) \({\hat{d}}_{C_{1}}(v,b_{2})\) \({\hat{\sigma }}_{vb_{1}}\) \({\hat{\sigma }}_{vb_{2}}\)
1 0 2 1 2
2 2 0 2 1
3 0 0 1 1
4 0 0 1 1
5 0 2 1 2
6 0 0 1 1
14 0 0 1 1