Fig. 9From: Fast cluster-based computation of exact betweenness centrality in large graphsComparison with the solution proposed in [13]. Algorithmic speedup analysis with synthetic graphs in sequential mode- \(AS^{{\mathcal {E}}/{\mathcal {B}}}_{p=1}\) and \(AS^{{\mathcal {H}}/{\mathcal {B}}}_{p=1}\). \(AS^{{\mathcal {H}}/{\mathcal {B}}}_{p=1}\) is always equal to 1 for synthetic graphs (see section "Synthetic graphs analysis"). We therefore add only one single zoomed bar in the figure just to make it visible to the readerBack to article page