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 ...
Abstract: The multi-robot coverage motion planning (MCMP) problem in which every reachable area must be covered is common in multi-robot systems. To deal with the MCMP problem, we propose an efficient ...
Abstract: A new approach, Dynamic Minimal Spanning Tree (DMST) algorithm, which is based on the MST algorithm is proposed in this paper to optimize the cable connection layout for large scale offshore ...
What would you like to Propose? I would like to propose adding an implementation of Edmonds's algorithm (also known as the Chu–Liu/Edmonds algorithm) for finding a Minimum Spanning Arborescence. A ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results