GitHub

Parallel Minimum Spanning Tree (MST) using Borůvka's Algorithm

This project provides a massively parallel implementation of a Minimum Spanning Tree (MST) graph algorithm using NVIDIA CUDA. The implementation is based on Borůvka's algorithm, which is highly ...
GitHub

AlirezaBoroon/Prim-s-Algorithm-in-creating-a-MST

Prim's Algorithm in Creating a MST program visually shows the target MST (Minimum Spanning Tree) with all steps of reaching to it, finally tells the log of selected graph edges and Adjacency matrix of ...
Europe PMC

Fast clustering algorithm based on MST of representative points.

Minimum spanning tree (MST)-based clustering algorithms are widely used to detect clusters with diverse densities and irregular shapes. However, most algorithms require the entire dataset to construct ...
IEEE

MST Clustering Algorithm Based on Optimized Grid

Abstract: A MST clustering algorithm based on optimized grid (OGMST) is presented. On one hand,the OGMST dealt with datasets by the way of MST, on the other hand,it resolved the MST algorithm's ...