Alternatives and similar repositories for vertex_cover:

Users that are interested in vertex_cover are comparing it to the libraries listed below

• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 3 years ago
• KarlsruheMIS / pace-2019
  Winning Solver of PACE Challenge 2019 Track A
  ☆13Updated 3 years ago
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆73Updated 2 weeks ago
• wata-orz / steiner_tree
  Steiner tree solver
  ☆30Updated 6 years ago
• darrenstrash / open-mcs
  An open implementation of the MC family of maximum clique algorithms
  ☆11Updated 8 years ago
• togatoga / togasat
  A Header-Only CDCL SAT Solver for Programming Contest
  ☆67Updated 5 years ago
• chuanluocs / MetaVC
  Repository for MetaVC -- A Meta Local Search Framework For Minimum Vertex Cover (MinVC)
  ☆10Updated 3 years ago
• Udopia / gbd
  Management of Benchmark Instances and Instance Attributes
  ☆19Updated last week
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆37Updated last month
• niklas-uhl / katric
  KaTric: scalable distributed-memory triangle counting made in Karlsruhe
  ☆13Updated last year
• kahypar / mt-kahypar
  Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…
  ☆140Updated last week
• mabseher / htd
  A small but efficient C++ library for computing (customized) tree and hypertree decompositions.
  ☆52Updated last year
• ciaranm / glasgow-subgraph-solver
  A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.
  ☆77Updated 2 months ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆206Updated 4 months ago
• yosupo06 / Algorithm
  プログラミングコンテスト用のライブラリ
  ☆105Updated last year
• domschrei / mallob
  Malleable Load Balancer. Massively Parallel Logic Backend. Award-winning SAT solving for the cloud.
  ☆66Updated last week
• MengxuanZhang1 / DynamicShortestPath_VLDB21
  ☆11Updated last year
• hu-macsy / dhb
  Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
  ☆12Updated 3 weeks ago
• kunisura / TdZdd
  A top-down/breadth-first decision diagram manipulation framework
  ☆59Updated last year
• KaHIP / KaMinPar
  Shared-Memory and Distributed-Memory Parallel Graph Partitioning
  ☆38Updated last week
• iwiwi / pruned-landmark-labeling
  Fast and exact shortest-path distance querying index
  ☆90Updated 10 years ago
• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• kamping-site / kassert
  Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…
  ☆11Updated 2 months ago
• ansrlab / edgepart
  Graph edge partitioning algorithms
  ☆45Updated 5 years ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• liffiton / PyMiniSolvers
  A Python API for the MiniSat and MiniCard constraint solvers.
  ☆20Updated last year
• ftiasch / shoka
  Code Snippets for Competitive Programming
  ☆19Updated 2 weeks ago
• LijunChang / MC-BRB
  Maximum clique computation over large sparse graphs
  ☆19Updated 3 years ago
• FTRobbin / Dreadnought-Standard-Code-Library
  Standard Code Library of the ACM-ICPC team SJTU Dreadnought(15.07-16.05) for World Finals 2016
  ☆33Updated 8 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆87Updated 5 years ago