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 ...
Frontiers

Comparative evaluation of fast-learning classification algorithms for urban forest tree species identification using EO-1 hyperion hyperspectral imagery

Introduction: Accurate identification of forest tree species is essential for sustainable forest management, biodiversity assessment, and environmental monitoring. Urban forests, in particular, ...
IEEE

802.1Qdy-2025 - IEEE Standard for Local and Metropolitan Area Networks--Bridges and Bridged Networks Amendment 40: YANG for the Multiple Spanning Tree Protocol

Abstract: This amendment to IEEE Std 802.1Q-2022 as amended by IEEE Std 802.1Qcz-2023, IEEE Std 802.1Qcw-2023, IEEE Std 802.1Qcj-2023, IEEE Std 802.1Qdj-2024, and IEEE Std 802.1Qdx-2024 addresses ...
GitHub

minimum-spanning-tree

PCGEx is a free (libre) Unreal 5 plugin that expands PCG capabilities. It offers a variety of high-performance nodes; with an edge for building relational graphs (Freeform, Delaunay, Voronoi, MST etc) ...
IEEE

Efficient ADMM Algorithm for Marginal Distributionally Robust Minimum Mean Square Error Problem

Abstract: In this paper, we develop an efficient alternating direction method of multipliers (ADMM) algorithm for solving the marginal distributionally robust minimum ...