Experimental Study of the Time Complexity of Basic Algorithms for Optimal Separation of Graphs

Abstract

The effectiveness of parallel computing for solving problems of cryptanalysis is determined by the distribution of computational load between processors. The mathematical model to optimize this balance is the optimal division of weighted graph. In this paper the basic algorithms for partitioning sets, providing an effective solution of this problem are considered.

Keywords

• cluster
• parallel programming
• separation graph