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:
- Maximum independent sets and vertex covers of large sparse graphs.☆78Updated 2 months ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- Library for finding maximum cliques on graphs☆16Updated 3 years ago
- Dynamic data structure for sparse graphs.☆31Updated last year
- Near-linear time algorithm for computing near-maximum independent set☆19Updated 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
- Quickly compute all maximal cliques of a graph☆80Updated 6 years ago
- A small but efficient C++ library for computing (customized) tree and hypertree decompositions.☆56Updated 2 years ago
- Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"☆14Updated 2 years ago
- CPAM: Compressed Parallel Augmented Maps☆24Updated 3 weeks ago
- KaGen: Communication-free Massively Distributed Graph Generators☆42Updated last month
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆134Updated last week
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆447Updated 4 months ago
- A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.☆87Updated 2 weeks ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆159Updated last year
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆87Updated 6 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through d…☆61Updated last year
- GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org☆136Updated 2 years ago
- The Chuffed CP solver☆109Updated last month
- Solving All Pairs Shortest Paths with Floyd Warshall's Algorithm and Johnson's Algorithm, using OpenMP and CUDA☆32Updated 7 years ago
- A collection of resources on dynamic/streaming/temporal/evolving graph processing systems, databases, data structures, datasets, and rela…☆140Updated 2 years ago
- GBBS: Graph Based Benchmark Suite☆212Updated last month
- Source code of "Accelerating Truss Decomposition on Heterogeneous Processors", accepted by VLDB'20 - By Yulin Che, Zhuohang Lai, Shixuan …☆16Updated 5 years ago
- Source code and datasets of "An In-Depth Study of Continuous Subgraph Matching", accepted by VLDB'22 - By Xibo Sun, Dr. Shixuan Sun, Prof…☆50Updated 2 years ago
- PyTorch implementation of NeuroSAT☆28Updated 2 years ago
- A parallel packed CSR data structure for large-scale dynamic graphs☆13Updated 2 years ago
- A standalone local search solver for general mixed integer programming☆25Updated 2 weeks ago
- High-Performance Linear Algebra-based Graph Primitives on GPUs☆230Updated 4 years ago