moorejs / APSP-in-parallelLinks
Solving All Pairs Shortest Paths with Floyd Warshall's Algorithm and Johnson's Algorithm, using OpenMP and CUDA
☆33Updated 7 years ago
Alternatives and similar repositories for APSP-in-parallel
Users that are interested in APSP-in-parallel are comparing it to the libraries listed below
Sorting:
- A fast implementation of spectral clustering on GPU-CPU Platform☆32Updated 7 years ago
- ☆31Updated 5 years ago
- CUDA implementation of the Blocked Floyd Warshall All pairs shortest path graph algorithm☆42Updated 7 years ago
- An open implementation of the MC family of maximum clique algorithms☆12Updated 9 years ago
- Quickly compute all maximal cliques of a graph☆80Updated 7 years ago
- A minimalistic header only C++11 Neural Network library based on Eigen::Tensor☆20Updated 8 years ago
- Galois: C++ library for multi-core and multi-node parallelization☆347Updated last year
- A static scheduling heuristic☆51Updated 3 years ago
- High-Performance Linear Algebra-based Graph Primitives on GPUs☆234Updated 4 years ago
- Parallel network flows using OpenMP and CUDA.☆28Updated 7 years ago
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆17Updated 7 months ago
- Static analysis framework for analyzing programs written in TVM's Relay IR.☆29Updated 6 years ago
- TopK Algorithms Benchmark☆10Updated 6 years ago
- ☆70Updated 4 years ago
- G3: A Programmable GNN Training System on GPU☆43Updated 5 years ago
- IMPACT GPU Algorithms Teaching Labs☆59Updated 2 years ago
- ☆21Updated 6 years ago
- GGNN: State of the Art Graph-based GPU Nearest Neighbor Search☆169Updated 11 months ago
- Implementation of Parallel Breadth-First Search on Distributed Memory Systems☆11Updated 10 years ago
- NetworkX Addon to allow graph partitioning with METIS☆80Updated 2 years ago
- GBBS: Graph Based Benchmark Suite☆216Updated last month
- Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019☆58Updated 3 years ago
- PyTorch Library for Low-Latency, High-Throughput Graph Learning on GPUs.☆301Updated 2 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆79Updated last week
- Dynamic data structure for sparse graphs.☆31Updated last year
- The official SALIENT system described in the paper "Accelerating Training and Inference of Graph Neural Networks with Fast Sampling and P…☆40Updated 2 years ago
- This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"☆14Updated 4 years ago
- Ullman Algorithm - An Algorithm for Subgraph Isomorphism☆27Updated 2 years ago
- NeuroVectorizer is a framework that uses deep reinforcement learning (RL) to predict optimal vectorization compiler pragmas for for loops…☆98Updated 3 years ago
- ☆112Updated 4 years ago