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:
- The implementation for maximum clique enumeration algorithm☆11Updated 9 years ago
- ☆9Updated 6 years ago
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆24Updated 8 years ago
- Hornet data structure for sparse dynamic graphs and matrices☆85Updated 5 years ago
- LonestarGPU: Irregular algorithms parallelized for GPUs☆35Updated 5 years ago
- A Distributed Multi-GPU System for Fast Graph Processing☆65Updated 6 years ago
- High-Performance Streaming Graph Analytics on GPUs☆33Updated 6 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)☆31Updated 11 months ago
- GraphMat graph analytics framework☆102Updated 2 years ago
- Graph Coarsening and Partitioning Library☆32Updated 5 years ago
- Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code☆62Updated 4 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
- New version of pbbs benchmarks☆94Updated last year
- Hybrid methods for Parallel Betweenness Centrality on the GPU☆24Updated 6 years ago
- Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.☆31Updated 8 years ago
- GBBS: Graph Based Benchmark Suite☆211Updated 7 months ago
- GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org☆134Updated 2 years ago
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 3 years ago
- Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019☆57Updated 3 years ago
- mini is mini☆20Updated 5 years ago
- Multi-way graph partitioning algorithms: FMS (Fiduccia-Mattheyses-Sanchis), PLM (Partitioning by Locked Moves), PFM (Partitioning by Free…☆38Updated 4 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 5 years 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
- Master's thesis project involving label-constrained reachability (LCR)☆1Updated 4 years ago
- A Comprehensive Benchmark Suite for Graph Computing☆70Updated 6 years ago
- TTC: A high-performance Compiler for Tensor Transpositions☆20Updated 7 years ago
- Asynchronous Multi-GPU Programming Framework☆46Updated 4 years ago
- A DSL for efficient Graph Analysis☆102Updated 6 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆88Updated 6 years ago