The idea behind a group of methods in community detection, called divisive algorithms, consists of determining the links between nodes from different clusters. Once these links have been identified, they are removed and thus only the intra-community links remain [1]}.
We invoke a similar idea to our linear clustering process.
