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

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

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 set...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Bezopasnostʹ informat͡s︡ionnykh tekhnologiĭ 2010-03, Vol.17 (1), p.45-46
Hauptverfasser: G. I. Borzunov, A. E. Voinov, E. A. Suchkova
Format: Artikel
Sprache:eng
Schlagworte:
cluster
parallel programming
separation graph
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2074-7128
2074-7136