in two modules by choosing the eigenvector with the   largest eigenvalue, such that negative and positive components of this eigenvector   specifies the division. To implement this algorithm,   <tt>BiMat</tt> first converts the bipartite matrix into its unipartite version   and the initial step.</li></ul></div><p>In addition to optimize the standard modularity @Q_b@ \bimat also evaluates (after optimizing @Q_b@) an a posteriori measure of modularity @Q_r@ introduced in <a href="http://f1000research.com/arti