Many thanks for the very motivated example of graph partition! There is a question. The first condition is balance the works and the amount of the works is prop to the number of nonzeros. From the graph, i think it should be corresponding to the number of edges within each partition. However, the final formulation of this problem is |v_i|~|v_j|, that is the number of vertex.
