darrenstrash / open-mcsLinks
An open implementation of the MC family of maximum clique algorithms
☆12Updated 9 years ago
Alternatives and similar repositories for open-mcs
Users that are interested in open-mcs are comparing it to the libraries listed below
Sorting:
- Library for finding maximum cliques on graphs☆16Updated 3 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆41Updated this week
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆79Updated last month
- GBBS: Graph Based Benchmark Suite☆214Updated 3 months ago
- Quickly compute all maximal cliques of a graph☆80Updated 7 years ago
- Dynamic data structure for sparse graphs.☆31Updated last year
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆90Updated 6 years ago
- Algorithms to list k-cliques in real-world graphs☆25Updated 4 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 7 years ago
- Near-linear time algorithm for computing near-maximum independent set☆19Updated 3 years ago
- CPAM: Compressed Parallel Augmented Maps☆26Updated 3 months ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆161Updated 2 years ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆464Updated 3 weeks ago
- A small but efficient C++ library for computing (customized) tree and hypertree decompositions.☆57Updated 2 years ago
- KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…☆11Updated 2 years ago
- This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"☆13Updated 4 years ago
- Source code of "PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration", published in SIGMOD'2021 - By Shixuan Sun, Yuhang Chen…☆16Updated 4 years ago
- Source code of "Accelerating Truss Decomposition on Heterogeneous Processors", accepted by VLDB'20 - By Yulin Che, Zhuohang Lai, Shixuan …☆16Updated 5 years ago
- A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.☆91Updated 2 weeks ago
- Graph edge partitioning algorithms☆48Updated 6 years ago
- G3: A Programmable GNN Training System on GPU☆43Updated 5 years ago
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆497Updated last month
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆45Updated last week
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 months ago
- COIN-OR Linear Programming Solver☆472Updated 3 weeks ago
- SPAA'21: Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths☆20Updated last year
- Solving All Pairs Shortest Paths with Floyd Warshall's Algorithm and Johnson's Algorithm, using OpenMP and CUDA☆32Updated 7 years ago
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆26Updated 8 years ago
- vertex cover solver☆30Updated 6 years ago