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, ...
Natural History Museum%2c London

Shark evolution: a 450 million year timeline

Sharks have been around for hundreds of millions of years, appearing in the fossil record before trees even existed. But what did they evolve from, are they ‘living fossils’, and how did they survive ...
IEEE

Efficient Algorithms for Computing Random Walk Centrality

Abstract: Random walk centrality is a fundamental metric in graph mining for quantifying node importance and influence, defined as the weighted average of hitting times to a node from all other nodes.
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) ...