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

Actuarial Risk Assessment and Pricing Optimization Algorithm Based on Graph Neural Network

Abstract: In this study, we proposed a new method combining graph sampling aggregation network (GraphSAGE), Contrastive Learning (CL) and Bayesian Optimization. First, GraphSAGE was used to model the ...
IEEE

Multi Source Heterogeneous Correlation Data Fusion Based on Graph Clustering and DFS Algorithm

Abstract: In multi-source heterogeneous correlated data, the correlation between data often needs to be established through multiple intermediate nodes or paths. This multi hop correlation may be lost ...
GitHub

Data-Structures-and-Algorithms-with-Java

This is a compilation of basic to advanced data structures, graph theory algorithms, dynamic programming, recursion, sorting, searching, and even string algorithms ...
C&EN

O1NumHess: A Fast and Accurate Seminumerical Hessian Algorithm Using Only O(1) Gradients

Qingdao Institute for Theoretical and Computational Sciences, Center for Optics Research and Engineering, Shandong University, Qingdao, Shandong 266237, P. R. China ...