istic to look for the optimal value of modules. This heuristic consists   in multiply the number of modules @N@ by a factor of two at each interaction as long   as the modularity value @Q_b@ continues to increase, at which time the heuristic   perform a bisection method between the last values @N@ that were visited.</li><li><tt>LPBrim</tt>: The algorithm is a combination between the BRIM and   LP algorithms. The heuristic of this algorithm consists in searching for the   best module configuration by first u