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
- mini is mini☆20Updated 5 years ago
- Implementation of QuadSketch algorithm☆11Updated 2 years ago
- Hornet data structure for sparse dynamic graphs and matrices☆84Updated 5 years ago
- A Distributed Multi-GPU System for Fast Graph Processing☆65Updated 6 years ago
- Next generation graph processing platform☆12Updated 8 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
- Solver for Unconstrained Binary Quadratic Optimization (UBQO, BQO, QUBO) and Max 2-SAT, based on semidefinite relaxation with constraint …☆15Updated 2 years ago
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆24Updated 8 years ago
- Dynamic PageRank☆16Updated 9 years ago
- A CUDA implementation of the PageRank Pipeline Benchmark☆32Updated 8 years ago
- A C++ Library for Influence Maximization☆33Updated 5 months ago
- Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…☆25Updated this week
- Graph Coarsening and Partitioning Library☆32Updated 5 years ago
- MPI+OpenMP implementation of Louvain method for Graph Community Detection, with a number of parallel heuristics/approximate computing tec…☆27Updated last year
- GNU Linear Programming Kit☆47Updated 4 years ago
- GraphMat graph analytics framework☆102Updated 2 years ago
- Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.☆31Updated 8 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
- ☆32Updated 4 years ago
- STOMP: Scheduling Techniques Optimization in heterogeneous Multi-Processors☆21Updated last month
- MPI based algorithm for detecting high centrality vertices in large graphs☆8Updated 10 years ago
- A benchmark suite for Graph Machine Learning☆19Updated 8 months ago
- Multi-way graph partitioning algorithms: FMS (Fiduccia-Mattheyses-Sanchis), PLM (Partitioning by Locked Moves), PFM (Partitioning by Free…☆38Updated 4 years ago
- Python CFFI Binding around SuiteSparse:GraphBLAS☆23Updated 2 months 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
- LonestarGPU: Irregular algorithms parallelized for GPUs☆35Updated 5 years ago
- Distributed Graph Mining on a Massive "Single" Graph☆15Updated 5 years ago
- Input (scripts, etc.) and output (scripts, performance results, etc.) for Gunrock and other graph engines☆10Updated last year