Alternatives and similar repositories for glasgow-subgraph-solver

Users that are interested in glasgow-subgraph-solver are comparing it to the libraries listed below

• mabseher / htd
  A small but efficient C++ library for computing (customized) tree and hypertree decompositions.
  ☆59Updated 2 years ago
• domschrei / mallob
  Malleable Load Balancer. Massively Parallel Logic Backend. Award-winning SAT solving for the cloud.
  ☆80Updated last week
• audemard / glucose
  The glucose SAT solver
  ☆131Updated last week
• muhos / ParaFROST
  A Parallel SAT Solver with GPU Accelerated Inprocessing
  ☆139Updated last month
• arminbiere / lingeling
  Lingeling SAT Solver
  ☆106Updated last year
• sat-group / open-wbo
  Open-WBO: state-of-the-art MaxSAT and Pseudo-Boolean solver
  ☆77Updated 2 years ago
• cuddorg / cudd
  CUDD Decision Diagram Package
  ☆148Updated 3 weeks ago
• biotomas / ipasir
  The Standard Interface for Incremental Satisfiability Solving
  ☆50Updated 3 years ago
• latte-int / latte
  LattE integrale, software for counting lattice points and integration over convex polytopes
  ☆50Updated 8 months ago
• MassimoLauria / cnfgen
  CNF generator in DIMACS format. It produces common families of CNFs.
  ☆70Updated 4 months ago
• utwente-fmt / sylvan
  Multi-core Decision Diagram (BDD/LDD) implementation
  ☆44Updated 2 years ago
• Laakeri / sharpsat-td
  Entry to model counting competition 2021.
  ☆24Updated last year
• meelgroup / ganak
  High-performance model counter
  ☆50Updated 2 weeks ago
• arminbiere / cadical
  CaDiCaL SAT Solver
  ☆509Updated this week
• arminbiere / gimsatul
  ☆35Updated 5 months ago
• arminbiere / satch
  SAT Solver SATCH
  ☆120Updated 3 years ago
• OxiDD / oxidd
  Concurrent decision diagram framework written in Rust
  ☆77Updated last month
• trolando / sylvan
  Implementation of multi-core (binary) decision diagrams
  ☆83Updated 4 months ago
• marijnheule / drat-trim
  The DRAT-trim proof checker
  ☆68Updated last year
• tulip-control / dd
  Binary Decision Diagrams (BDDs) in pure Python and Cython wrappers of CUDD, Sylvan, and BuDDy
  ☆215Updated 3 weeks ago
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆78Updated 2 months ago
• ssoelvsten / adiar
  An I/O-efficient implementation of (Binary) Decision Diagrams
  ☆31Updated this week
• marijnheule / CnC
  Cube-and-Conquer SAT solver
  ☆42Updated 5 months ago
• philzook58 / awesome-egraphs
  An awesome list of e-graph resources
  ☆279Updated 3 weeks ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆214Updated 2 weeks ago
• alexander-nadel / intel_sat_solver
  This repository contains the code of Intel(R) SAT Solver (IntelSAT)
  ☆36Updated 9 months ago
• Simewu / top-SAT-solvers-2021
  The top three SAT solvers of 2021: kissat-MAB, lstech_maple, and kissat_gb.
  ☆22Updated 9 months ago
• kahypar / kahypar
  KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…
  ☆505Updated this week
• VeriFIT / mata
  A fast and simple automata library
  ☆31Updated this week
• maximaximal / Paracooba
  Distributed and ressource elastic cube-and-conquer SAT & QBF solver
  ☆20Updated 2 years ago