Plamadyalov

In this paper, we present the two realizations networks partitioning: in set operations and with using hypergraph operations. The second variant partitioning description is more compact and clear. The asymptotic computation complexity of both realizations is equal. The formal description of multilevel hypergraph partitioning is received. This description make possible easily to estimate the transformations that demand very large quantity actions.