humayunk1 / PKCLinks
Parallel k-core Decomposition on Multicore Platforms
☆11Updated 4 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☆24Updated 8 years ago
- ☆9Updated 6 years ago
- Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…☆30Updated 6 years ago
- Dynamic data structure for sparse graphs.☆30Updated last year
- 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
- A benchmark suite for Graph Machine Learning☆19Updated 8 months ago
- Asynchronous Multi-GPU Programming Framework☆46Updated 4 years ago
- A Distributed Multi-GPU System for Fast Graph Processing☆65Updated 6 years ago
- Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.☆31Updated 8 years ago
- LonestarGPU: Irregular algorithms parallelized for GPUs☆35Updated 5 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 5 years ago
- mini is mini☆20Updated 5 years ago
- This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"☆12Updated 4 years ago
- SIMD-X: Programming and Processing of Graph Algorithms on GPUs [USENIX ATC '19]☆20Updated 5 years ago
- OpenMP implementation of Graph Community Detection, with a number of parallel heuristics/approximate computing techniques☆20Updated 2 years ago
- ☆29Updated 8 years ago
- CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.☆52Updated 9 years ago
- A CUDA-based multi-GPU vertex-centric graph processing framework based on Warp Segmentation and Vertex Refinement techniques.☆10Updated 8 years ago
- A Comprehensive Benchmark Suite for Graph Computing☆70Updated 6 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- The implementation for maximum clique enumeration algorithm☆11Updated 9 years ago
- Lumos: Dependency-Driven Disk-based Graph Processing☆20Updated 5 years ago
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆24Updated 9 years ago
- The source code for BUTTERFLY COUNTING IN BIPARTITE NETWORKS☆12Updated 6 years ago
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning