ciaranm / glasgow-subgraph-solverLinks
A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.
☆83Updated 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.☆66Updated last week
- A small but efficient C++ library for computing (customized) tree and hypertree decompositions.☆56Updated last year
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆147Updated this week
- The glucose SAT solver☆116Updated last month
- Lingeling SAT Solver☆102Updated last year
- CUDD: CU Decision Diagram package - unofficial git mirror of https://web.archive.org/web/20180127051756/http://vlsi.colorado.edu/~fabio/C…☆131Updated 2 years ago
- Isomorphism testing and automorphisms of graphs☆66Updated 10 months ago
- A Parallel SAT Solver with GPU Accelerated Inprocessing☆119Updated 2 weeks ago
- GBBS: Graph Based Benchmark Suite☆211Updated 7 months ago
- High-performance probabilistic exact counter☆41Updated 3 weeks ago
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆476Updated last week
- CPAM: Compressed Parallel Augmented Maps☆24Updated last week
- Multi-core Decision Diagram (BDD/LDD) implementation☆44Updated last year
- Implementation of multi-core (binary) decision diagrams☆76Updated last year
- ☆11Updated 3 years ago
- BuDDy BDD package (with CMake support)☆12Updated last year
- Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…☆27Updated last week
- Dynamic data structure for sparse graphs.☆29Updated last year
- LattE integrale, software for counting lattice points and integration over convex polytopes☆48Updated 2 months ago
- New version of pbbs benchmarks☆94Updated last year
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆130Updated last week
- The Standard Interface for Incremental Satisfiability Solving☆50Updated 3 years ago
- Cube-and-Conquer SAT solver☆36Updated this week
- ☆34Updated 2 weeks ago
- Concurrent decision diagram framework written in Rust☆62Updated last month
- KaGen: Communication-free Massively Distributed Graph Generators☆40Updated 2 weeks ago
- An I/O-efficient implementation of (Binary) Decision Diagrams☆29Updated this week
- MaxHS: a hybrid Maxsat solver developed by Jessica Davies and Fahiem Bacchus☆26Updated 3 years ago
- Resources on the GraphBLAS standard for graph algorithms in the language of linear algebra☆195Updated 8 months ago
- SAT Solver SATCH☆120Updated 2 years ago