GitHub

Minimum Spanning Tree implementation using Kruskal's Algorithm in C++

This project implements Kruskal’s Algorithm to generate a Minimum Spanning Tree (MST) for a weighted graph. The goal is to determine the minimum-cost network (fiber optic cable laying) that connects ...
GitHub

VusalIs/Maze-Generation-DFS-Kruskal

Randomized Kruskal's Algorithm What is Kruskal Algorithm? Kruskal's Algorithm originally used to find a minimum spanning tree for a given tree. The minimum spanning tree is a subtree of the given tree ...
IEEE

An Approach to Parallelize Kruskal's Algorithm Using Helper Threads

Abstract: In this paper we present a Helper Threading scheme used to parallelize efficiently Kruskal's Minimum Spanning Forest algorithm. This algorithm is known for exhibiting inherently sequential ...
IEEE

Hybrid Data Transfer System Leveraging Selective Repeat ARQ, Kruskal's Algorithm, Blowfish Encryption, and TCP Tahoe Mechanism

Abstract: This paper presents a unified system design that strengthens secure and efficient data transmission over unreliable networks by integrating Selective Repeat Automatic Repeat reQuest (ARQ), ...