Skip to main content
Computational Social Networks
Fig. 6 | Computational Social Networks

Fig. 6

From: Clustering 1-dimensional periodic network using betweenness centrality

Fig. 6

Computation times when the inputs are random graphs generated from Erdős-Rényi model [46]. 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 time for the classical centrality on the static graphs

Back to article page