Fig. 7
From: Clustering 1-dimensional periodic network using betweenness centrality
Computation times when the inputs are graphs with small-world properties generated from Watts-Strogatz model [47]. a Comparison between the computation times for the periodic betweenness centrality and the classical centrality on the static graphs. b The computation times for the periodic betweenness centrality divided by the computation times for the classical centrality on the static graphs