linhongseba / MaximumCliqueLinks
The implementation for maximum clique enumeration algorithm
☆11Updated 9 years ago
Alternatives and similar repositories for MaximumClique
Users that are interested in MaximumClique are comparing it to the libraries listed below
Sorting:
- Parallel k-core Decomposition on Multicore Platforms☆11Updated 4 years ago
- High-Performance Streaming Graph Analytics on GPUs☆32Updated 6 years ago
- A Distributed Multi-GPU System for Fast Graph Processing☆65Updated 6 years ago
- Hornet data structure for sparse dynamic graphs and matrices☆84Updated 5 years ago
- mini is mini☆20Updated 5 years ago
- The STINGER in-memory graph store and dynamic graph analysis platform. Millions to billions of vertices and edges at thousands to millio…☆11Updated 9 years ago
- A benchmark suite for Graph Machine Learning☆19Updated 8 months ago
- Graph Challenge☆31Updated 5 years ago
- Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.☆31Updated 8 years ago
- STOMP: Scheduling Techniques Optimization in heterogeneous Multi-Processors☆22Updated last month
- A CUDA implementation of the PageRank Pipeline Benchmark☆32Updated 8 years ago
- Multi-way graph partitioning algorithms: FMS (Fiduccia-Mattheyses-Sanchis), PLM (Partitioning by Locked Moves), PFM (Partitioning by Free…☆38Updated 4 years ago
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆24Updated 8 years ago
- ibmgraphblas☆27Updated 6 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- A framework for evaluating community mining algorithms.☆11Updated 9 years ago
- A graph processing engine for hybrid CPU and GPU platforms☆38Updated 6 years ago
- GraphMat graph analytics framework☆102Updated 2 years ago
- A vertex-centric CUDA/C++ API for large graph analytics on GPUs using the Gather-Apply-Scatter abstraction☆23Updated 11 years ago
- ☆15Updated 7 years ago
- A graph application benchmark suite☆21Updated 10 years ago
- SQL Optimizations using MLIR☆11Updated 5 years ago
- Artifacts for SOSP'19 paper Optimizing Deep Learning Computation with Automatic Generation of Graph Substitutions☆21Updated 3 years ago
- ☆9Updated 6 years ago
- Implementation of netsimile Algorithm to detect anomalies in time series graphs.☆10Updated 10 years ago
- A CUDA-based multi-GPU vertex-centric graph processing framework based on Warp Segmentation and Vertex Refinement techniques.☆10Updated 8 years ago
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆18Updated 7 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
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆26Updated 4 years ago
- This repository contains the cuStinger data structure used for dynamic graph representation.☆19Updated 6 years ago