ciaranm / glasgow-subgraph-solverLinks
A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.
☆97Updated last week
Alternatives and similar repositories for glasgow-subgraph-solver
Users that are interested in glasgow-subgraph-solver are comparing it to the libraries listed below
Sorting:
- Malleable Load Balancer. Massively Parallel Logic Backend. Award-winning SAT solving for the cloud.☆81Updated this week
- CUDD Decision Diagram Package☆151Updated last month
- The Standard Interface for Incremental Satisfiability Solving☆51Updated 3 years ago
- A Parallel SAT Solver with GPU Accelerated Inprocessing☆138Updated 2 months ago
- A small but efficient C++ library for computing (customized) tree and hypertree decompositions.☆63Updated 2 years ago
- Lingeling SAT Solver☆105Updated last year
- The glucose SAT solver☆136Updated last month
- Multi-core Decision Diagram (BDD/LDD) implementation☆44Updated 2 years ago
- Implementation of multi-core (binary) decision diagrams☆83Updated 5 months ago
- This repository contains the code of Intel(R) SAT Solver (IntelSAT)☆37Updated 10 months ago
- State-of-the-art MaxSAT Solver & Library Based on Unsat Core Guided Techniques☆28Updated 3 months ago
- SAT Solver SATCH☆120Updated 3 years ago
- High-performance model counter☆53Updated this week
- Cube-and-Conquer SAT solver☆44Updated 6 months ago
- CaDiCaL SAT Solver☆514Updated this week
- The DRAT-trim proof checker☆68Updated last year
- Open-WBO: state-of-the-art MaxSAT and Pseudo-Boolean solver☆77Updated 2 years ago
- Management of Benchmark Instances and Instance Attributes☆20Updated last month
- Maximum independent sets and vertex covers of large sparse graphs.☆79Updated last week
- An I/O-efficient implementation of (Binary) Decision Diagrams☆31Updated this week
- ☆35Updated 6 months ago
- An awesome list of e-graph resources☆293Updated last month
- Binary Decision Diagrams (BDDs) in pure Python and Cython wrappers of CUDD, Sylvan, and BuDDy☆215Updated 2 months ago
- LattE integrale, software for counting lattice points and integration over convex polytopes☆51Updated 9 months ago
- CNF generator in DIMACS format. It produces common families of CNFs.☆70Updated 6 months ago
- Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…☆33Updated this week
- Concurrent decision diagram framework written in Rust☆77Updated 2 months ago
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆508Updated 3 weeks ago
- Entry to model counting competition 2021.☆24Updated last year
- Automated Reasoning in Nonlinear Theories of Reals☆179Updated last week