A parallel algorithm for searching the minimum weight spanning tree on prefractal graph

Prefractal (fractal) graphs are models of complex self-similar structures. Hence, there is a need in theoretical studies related to processing prefractal graph models. In view of a large dimension of prefractal graphs, it is advisable to analyze these models on parallel computational systems. In this paper, a parallel algorithm for searching the minimum weight spanning tree of a prefractal graph is suggested. The parallelization of the algorithm is based on the use of self-similarity properties of prefractal graphs.