Community discovery algorithm - KL algorithm

K-L (Kernighan Lin) algorithm Original paper( An efficient heuristic procedure for partitioning graphs) K-L (Kernighan Lin) algorithm is a dichotomy method that divides a known network into two communities of known size. It is a greedy algorithm. Its main idea is to define a function gain Q for network partition. Q is the difference between ...

Posted by Jack_Slocum on Fri, 04 Feb 2022 03:30:40 +0100