linhongseba / MaximumClique
The implementation for maximum clique enumeration algorithm
☆11Updated 8 years ago
Alternatives and similar repositories for MaximumClique:
Users that are interested in MaximumClique are comparing it to the libraries listed below
- Parallel k-core Decomposition on Multicore Platforms☆11Updated 4 years ago
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆26Updated 3 years ago
- A Distributed Multi-GPU System for Fast Graph Processing☆65Updated 6 years ago
- ☆16Updated 3 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆12Updated 4 years ago
- Implementation of QuadSketch algorithm☆11Updated 2 years ago
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆23Updated 7 years ago
- High-Performance Streaming Graph Analytics on GPUs☆31Updated 6 years ago
- A fast implementation of spectral clustering on GPU-CPU Platform☆31Updated 6 years ago
- mini is mini☆21Updated 5 years ago
- A framework for evaluating community mining algorithms.☆11Updated 9 years ago
- ☆9Updated 6 years ago
- MPI+OpenMP implementation of Louvain method for Graph Community Detection, with a number of parallel heuristics/approximate computing tec…☆27Updated last year
- ☆8Updated 6 years ago
- A parallel packed CSR data structure for large-scale dynamic graphs☆14Updated 2 years ago
- propositional satisfiability problem (SAT) goes neural and deep☆12Updated 3 years ago
- Multi-way graph partitioning algorithms: FMS (Fiduccia-Mattheyses-Sanchis), PLM (Partitioning by Locked Moves), PFM (Partitioning by Free…☆37Updated 4 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
- Dynamic data structure for sparse graphs.☆29Updated 11 months ago
- ☆15Updated 7 years ago
- Optimal approximate sampling from discrete probability distributions☆17Updated 4 years ago
- Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.☆31Updated 7 years ago
- ☆8Updated 8 years ago
- An Architecture-level Fault Injection Tool for GPU Application Resilience Evaluations☆16Updated 4 years ago
- Hornet data structure for sparse dynamic graphs and matrices☆81Updated 5 years ago
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆17Updated 6 years ago
- Alchemist: an Apache Spark<->MPI interface☆26Updated 6 years ago
- graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation☆11Updated 7 years ago
- ☆31Updated 4 years ago