Parallel modularity computation for directed weighted graphs with overlapping communities
The paper presents new versions of modularity measure for directed weighted graphs with overlapping communities. We consider several approaches to computing modularity and try to extend them. Taking into account computational complexity, we suggest two parallelized extensions which are scalable to large graphs (more than 104 nodes).
Proceedings of the Institute for System Programming, vol. 28, issue 6, 2016, pp. 153-170.
ISSN 2220-6426 (Online), ISSN 2079-8156 (Print).
DOI: 10.15514/ISPRAS-2016-28(6)-11Full text of the paper in pdf Back to the contents of the volume