These networks were subsequently decomposed into modules using the edge-betweenness clustering algorithm proposed by Girvan and Newman [21,28], based on the iterative removal of edges with the highest number of paths running through it (see also Figure S3).
![[This page as RDF]](http://data.gesis.org/somesci/static/rdf-icon.gif){kind=icon}