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.
  ☆56Updated 2 years ago
• domschrei / mallob
  Malleable Load Balancer. Massively Parallel Logic Backend. Award-winning SAT solving for the cloud.
  ☆67Updated last week
• muhos / ParaFROST
  A Parallel SAT Solver with GPU Accelerated Inprocessing
  ☆123Updated last month
• arminbiere / lingeling
  Lingeling SAT Solver
  ☆103Updated last year
• kahypar / mt-kahypar
  Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…
  ☆151Updated this week
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆78Updated last month
• ssoelvsten / adiar
  An I/O-efficient implementation of (Binary) Decision Diagrams
  ☆29Updated this week
• cuddorg / cudd
  CUDD Decision Diagram Package
  ☆140Updated last week
• biotomas / ipasir
  The Standard Interface for Incremental Satisfiability Solving
  ☆50Updated 3 years ago
• ParAlg / CPAM
  CPAM: Compressed Parallel Augmented Maps
  ☆24Updated last month
• alexander-nadel / intel_sat_solver
  This repository contains the code of Intel(R) SAT Solver (IntelSAT)
  ☆32Updated 4 months ago
• utwente-fmt / sylvan
  Multi-core Decision Diagram (BDD/LDD) implementation
  ☆44Updated last year
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆211Updated last week
• audemard / glucose
  The glucose SAT solver
  ☆120Updated 2 months ago
• kahypar / kahypar
  KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…
  ☆481Updated last month
• ssoelvsten / buddy
  BuDDy BDD package (with CMake support)
  ☆13Updated last year
• fbacchus / MaxHS
  MaxHS: a hybrid Maxsat solver developed by Jessica Davies and Fahiem Bacchus
  ☆26Updated 3 years ago
• MiviaLab / vf3lib
  VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
  ☆130Updated 3 weeks ago
• MassimoLauria / cnfgen
  CNF generator in DIMACS format. It produces common families of CNFs.
  ☆68Updated last month
• arminbiere / gimsatul
  ☆34Updated 2 weeks ago
• Laakeri / sharpsat-td
  Entry to model counting competition 2021.
  ☆22Updated last year
• latte-int / latte
  LattE integrale, software for counting lattice points and integration over convex polytopes
  ☆48Updated 3 months ago
• FlorentAvellaneda / EvalMaxSAT
  State-of-the-art MaxSAT Solver & Library Based on Unsat Core Guided Techniques
  ☆19Updated 3 weeks ago
• ChezJrk / verified-scheduling
  ☆41Updated last year
• lip6 / painless
  A framework to ease parallelization of sequential SAT solvers
  ☆19Updated 3 months ago
• sat-group / open-wbo
  Open-WBO: state-of-the-art MaxSAT and Pseudo-Boolean solver
  ☆77Updated last year
• marijnheule / drat-trim
  The DRAT-trim proof checker
  ☆63Updated 8 months ago
• shaowei-cai-group / ParKissat-RS
  Parallel SAT solver that won the SAT Competition 2022 by a large margin (24% faster than the 2nd ranked solver)
  ☆24Updated 2 years ago
• arminbiere / satch
  SAT Solver SATCH
  ☆120Updated 2 years ago
• maximaximal / Paracooba
  Distributed and ressource elastic cube-and-conquer SAT & QBF solver
  ☆20Updated 2 years ago