Skip to main content
Advertisement
Browse Subject Areas
?
Click through the PLOS taxonomy to find articles in your field.
For more information about PLOS Subject Areas, click here.
Finding Statistically Significant Communities in Networks
Figure 5
The diagram shows how the execution time of two different implementations of the algorithm scales with the network size (expressed by the number of vertices), for LFR benchmark graphs.