This is a fork of vite, where I am trying to measure the time to find communities on static graphs using the Louvain algorithm, as well as the modularity of communities found. I process the output logs and generate plots using sheets. Note that total time includes clustering time and rebuilding time (aggregation).
wolfram77 / ecp-exagraph--vite Goto Github PK
View Code? Open in Web Editor NEWThis project forked from ecp-exagraph/vite
MPI+OpenMP implementation of Louvain method for Graph Community Detection, with a number of parallel heuristics/approximate computing techniques
License: BSD 3-Clause "New" or "Revised" License