Benhard Sitohang
In this work, an analysis of RelaxMap algorithm and Modified Louvain algorithm is done to determine the optimal algorithm in computation. This analysis is done by comparing. These two ways can be combined into one integrated algorithm if the limit R is greater than the limit k. The modified Louvain algorithm is chosen to be implemented. The implementation is done by using and modifying the louvain-igraph library created by V. A. Traag. Implementation result program is used for experiments. From this experiment, it was found that time increases linearly if the limit R or k is increased, the number of vertices and the number of edges influences the increase of time when the limit R or k is increased, Mod. B is heavier than Mod. A in terms of computation, community search for a vertex uses considerable memory, and the limit k further influences processing time on the integrated modified Louvain algorithm. From this work, it can be concluded that the modified Louvain algorithm is more optimal in computation than RelaxMap algorithm if user do not need to pay attention to flow information.
Penerapan Teknologi Tepat Guna
To determine the optimal algorithm in computation