humayunk1 / PKCLinks
Parallel k-core Decomposition on Multicore Platforms
☆11Updated 5 years ago
Alternatives and similar repositories for PKC
Users that are interested in PKC are comparing it to the libraries listed below
Sorting:
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆25Updated 8 years ago
- LonestarGPU: Irregular algorithms parallelized for GPUs☆38Updated 5 years ago
- Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…☆29Updated 6 years ago
- GBBS: Graph Based Benchmark Suite☆214Updated 3 months ago
- ☆29Updated 8 years ago
- Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.☆31Updated 8 years ago
- Dynamic data structure for sparse graphs.☆31Updated last year
- Asynchronous Multi-GPU Programming Framework☆47Updated 4 years ago
- A Comprehensive Benchmark Suite for Graph Computing☆71Updated 6 years ago
- Hornet data structure for sparse dynamic graphs and matrices☆89Updated 5 years ago
- Parallel Graph Input Output☆18Updated 2 years ago
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆25Updated 10 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆89Updated 6 years ago
- Algorithms to list k-cliques in real-world graphs☆25Updated 4 years ago
- This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"☆13Updated 4 years ago
- Multi-threaded Large-Scale RMAT Graph Generator.☆130Updated 2 years ago
- A Distributed Multi-GPU System for Fast Graph Processing☆65Updated 7 years ago
- A Shared Memory Multithreaded Graph Benchmark Suite for Multicores☆36Updated 5 months ago
- A framework for pipelined computing on GPU☆30Updated 6 years ago
- ☆25Updated 11 months ago
- MPI+OpenMP implementation of Louvain method for Graph Community Detection, with a number of parallel heuristics/approximate computing tec…☆27Updated 3 months ago
- Frog is Asynchronous Graph Processing on GPU with Hybrid Coloring Model. The fundamental idea is based on Pareto principle (or 80-20 rule…☆36Updated 4 years ago
- ☆39Updated 6 years ago
- A warp-oriented dynamic hash table for GPUs☆76Updated last year
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 5 years ago
- GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org☆136Updated 2 years ago
- Parallel Maximum Clique Library☆118Updated 2 years ago
- Hybrid methods for Parallel Betweenness Centrality on the GPU☆24Updated 6 years ago
- ☆22Updated 4 years ago
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆25Updated 4 years ago