humayunk1 / PKC
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 7 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
- LonestarGPU: Irregular algorithms parallelized for GPUs☆35Updated 5 years ago
- Dynamic data structure for sparse graphs.☆30Updated last year
- The implementation for maximum clique enumeration algorithm☆11Updated 9 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 5 years ago
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆24Updated 9 years ago
- Hornet data structure for sparse dynamic graphs and matrices☆82Updated 5 years ago
- Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)☆30Updated 9 months ago
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆26Updated 3 years ago
- ☆21Updated 4 years ago
- A graph processing engine for hybrid CPU and GPU platforms☆38Updated 6 years ago
- mini is mini☆20Updated 5 years ago
- A Distributed Multi-GPU System for Fast Graph Processing☆65Updated 6 years ago
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 years ago
- GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org☆133Updated last year
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 3 years ago
- MPI+OpenMP implementation of Louvain method for Graph Community Detection, with a number of parallel heuristics/approximate computing tec…☆27Updated last year
- This repository contains information about graph processing.☆32Updated 9 months 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☆69Updated 6 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 3 years ago
- Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…☆25Updated 3 weeks ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆87Updated 5 years ago
- Parallel Maximum Clique Library☆116Updated last year
- A NUMA-aware Graph-structured Analytics Framework☆43Updated 6 years ago
- Asynchronous Multi-GPU Programming Framework☆46Updated 3 years ago
- ☆25Updated last year