Modularity of regular and treelike graphs
<p>Clustering algorithms for large networks typically use modularity values to test which partitions of the vertex set better represent structure in the data. The modularity of a graph is the maximum modularity of a partition. We consider the modularity of two kinds of graphs.</p> <br...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Published: |
Oxford University Press
2017
|