This repository contains source code that I wrote while working on my master's thesis. The objective of this thesis was to compare multiple Minimum Spanning Tree algorithms (which are graph algorithms ...
This folder contains all the codes for the paper Functional Data Clustering and Outlier Identification via Subgroup Analysis with Minimum Spanning Tree. ├── R/ ├── datageration.R # R functions to ...
1 College of Information and Computer, Taiyuan University of Technology, Taiyuan, China 2 Center of Information Management and Development, Taiyuan University of Technology, Taiyuan, China ...
Abstract: This paper proposes a method for generating and solving mazes using minimum spanning tree algorithms and parallelizing them using OpenMP. The approach involves generating a random maze using ...
You are the benevolent ruler of The Republic of Graphistan, and you want to modernize the roads between cities—widening them, repaving them, turning them into superhighways. But it’s complicated. When ...
Abstract: In this paper, using the BSP/CGM model, we propose a parallel algorithm and implement it on a GPGPU to obtain a minimum spanning tree of a graph. Previous works for this problem are based on ...