There are the problem of optimal separation of the graph into subgraphs and descriptions of the serial, parallel algorithms shows the efficiency of the parallel algorithm. in the paper. Sequential algorithm is implemented using the C programming language, the parallel - using MPI.
optimal separation of the graph into subgraphs, graph theory, adjacency matrix, weights
“Analiz rasparallelivaniia algoritma zadachi optimalnogo razdeleniia grafa na podgrafy”,
Scientific Works of Kharkiv National Air Force University,