linhongseba / MaximumClique
The implementation for maximum clique enumeration algorithm
☆11Updated 8 years ago
Related projects: ⓘ
- Parallel k-core Decomposition on Multicore Platforms☆10Updated 3 years ago
- A Distributed Multi-GPU System for Fast Graph Processing☆63Updated 5 years ago
- Input (scripts, etc.) and output (scripts, performance results, etc.) for Gunrock and other graph engines☆10Updated last year
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 4 years ago
- Efficient graph clustering software for normalized cut and ratio association on undirected graphs. Copyright(c) 2008 Brian Kulis, Yuqiang…☆22Updated 12 years ago
- High-Performance Streaming Graph Analytics on GPUs☆31Updated 5 years ago
- mini is mini☆17Updated 4 years ago
- Hornet data structure for sparse dynamic graphs and matrices☆78Updated 4 years ago
- A CUDA implementation of the PageRank Pipeline Benchmark☆32Updated 7 years ago
- Multi-way graph partitioning algorithms: FMS (Fiduccia-Mattheyses-Sanchis), PLM (Partitioning by Locked Moves), PFM (Partitioning by Free…☆37Updated 3 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆16Updated 5 years ago
- A CUDA-based multi-GPU vertex-centric graph processing framework based on Warp Segmentation and Vertex Refinement techniques.☆10Updated 7 years ago
- Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.☆30Updated 7 years ago
- A benchmark suite for Graph Machine Learning☆17Updated last month
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆24Updated 7 years ago
- Implementation of QuadSketch algorithm☆11Updated last year
- Dynamic data structure for sparse graphs.☆26Updated 5 months ago
- Near-linear time algorithm for computing near-maximum independent set☆16Updated 2 years ago
- ☆26Updated 4 years ago
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆25Updated 3 years ago
- The STINGER in-memory graph store and dynamic graph analysis platform. Millions to billions of vertices and edges at thousands to millio…☆12Updated 8 years ago
- Light-weight GPU kernel interface for graph operations☆15Updated 4 years ago
- A C++ Library for Influence Maximization☆31Updated 3 weeks ago
- STOMP: Scheduling Techniques Optimization in heterogeneous Multi-Processors☆20Updated 2 weeks ago
- Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)☆30Updated last month
- This repository contains the cuStinger data structure used for dynamic graph representation.☆18Updated 5 years ago
- ☆9Updated 7 years ago
- NetworkX Addon to allow graph partitioning with METIS☆79Updated 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 3 years ago
- A parallel packed CSR data structure for large-scale dynamic graphs☆13Updated last year