 To decompose an NP-hard network optimization task into subtasks, the network can be decomposed into relatively independent subnets.In order to partition the network, it is useful to visualize it as a weighted complete graph, where each vertex corresponds to a network element, and each edge has a weight equal to the rank of the correlation between each pair of corresponding elements.Then the most irrelevant interactions between elements of network are discarded.