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:
- KaGen: Communication-free Massively Distributed Graph Generators☆42Updated last week
- Library for finding maximum cliques on graphs☆16Updated 3 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆78Updated last month
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆443Updated 4 months ago
- Dynamic data structure for sparse graphs.☆31Updated last year
- A small but efficient C++ library for computing (customized) tree and hypertree decompositions.☆56Updated 2 years ago
- GBBS: Graph Based Benchmark Suite☆212Updated 2 weeks ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆88Updated 6 years ago
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆482Updated last month
- Graph edge partitioning algorithms☆46Updated 5 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆159Updated last year
- Source code of "Accelerating Truss Decomposition on Heterogeneous Processors", accepted by VLDB'20 - By Yulin Che, Zhuohang Lai, Shixuan …☆16Updated 5 years ago
- Implementation of the HYPE hypergraph partitioner.☆22Updated 5 years ago
- Source code of "RapidFlow: An Efficient Approach to Continuous Subgraph Matching" published in VLDB'2022 - By Shixuan Sun, Xibo Sun, Bing…☆32Updated 3 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…☆10Updated 2 years ago
- Near-linear time algorithm for computing near-maximum independent set☆19Updated 3 years ago
- New version of pbbs benchmarks☆95Updated last year
- A collection of resources on dynamic/streaming/temporal/evolving graph processing systems, databases, data structures, datasets, and rela…☆140Updated 2 years ago
- Distributed Graph Mining on a Massive "Single" Graph☆16Updated 5 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- A parallel packed CSR data structure for large-scale dynamic graphs☆13Updated 2 years ago
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆152Updated this week
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 years ago
- Steiner tree solver☆30Updated 7 years ago
- mini is mini☆20Updated 5 years ago
- A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.☆85Updated last month
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 4 months ago
- Source code of "PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration", published in SIGMOD'2021 - By Shixuan Sun, Yuhang Chen…☆14Updated 4 years ago
- Solving All Pairs Shortest Paths with Floyd Warshall's Algorithm and Johnson's Algorithm, using OpenMP and CUDA☆31Updated 7 years ago