Formation And Investigation Of Kruskal’S Algorithm Parallel Scheme For Shared Memory Systems
Artem Potebnia, Pogorilyi Sergiy · Zenodo (CERN European Organization for Nuclear Research) · 2012
Formalization of Kruskal’s algorithm for constructing a minimal spanning tree of an undirected graph using mathematical means of V.M. Glushkov’s algorithmic algebras modified systems is done. The conception of its paralleling for shared memory computer systems architectures is proposed. A set of algorithm investigations is conducted and its temporal characteristics are formed. Recommendations of algorithm usage for applied tasks solving are provided.