darrenstrash / open-mcs
An open implementation of the MC family of maximum clique algorithms
☆9Updated 8 years ago
Related projects: ⓘ
- Library for finding maximum cliques on graphs☆15Updated 2 years ago
- Near-linear time algorithm for computing near-maximum independent set☆16Updated 2 years ago
- Quickly compute all maximal cliques of a graph☆75Updated 5 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆35Updated this week
- Algorithms to list k-cliques in real-world graphs☆24Updated 3 years ago
- ☆9Updated 7 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆68Updated last month
- A small but efficient C++ library for computing (customized) tree and hypertree decompositions.☆46Updated last year
- CP 2015 subgraph isomorphism experiments, data and paper☆13Updated 9 years ago
- Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)☆30Updated last month
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆16Updated 5 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 4 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆25Updated 2 years ago
- Dynamic data structure for sparse graphs.☆26Updated 5 months ago
- Implementation of the HYPE hypergraph partitioner.☆17Updated 4 years ago
- CPAM: Compressed Parallel Augmented Maps☆19Updated last week
- ☆18Updated this week
- Hornet data structure for sparse dynamic graphs and matrices☆78Updated 4 years ago
- A tool for parallel and distributed enumeration of cliques and diameter two kplexes.☆14Updated last year
- A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.☆65Updated 2 months ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated last month
- Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.☆30Updated 7 years ago
- Source code of "PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration", published in SIGMOD'2021 - By Shixuan Sun, Yuhang Chen…☆14Updated 3 years ago
- Maximum clique computation over large sparse graphs☆17Updated 2 years ago
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆24Updated 7 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆85Updated 5 years ago
- A parallel packed CSR data structure for large-scale dynamic graphs☆13Updated last year
- Parallel Weighted Random Sampling☆19Updated 3 years ago
- ☆9Updated 5 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆83Updated 5 years ago