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 / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆77Updated 2 months ago
• KarlsruheMIS / pace-2019
  Winning Solver of PACE Challenge 2019 Track A
  ☆13Updated 3 years ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆39Updated last month
• wata-orz / steiner_tree
  Steiner tree solver
  ☆30Updated 7 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆211Updated 6 months ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• darrenstrash / open-mcs
  An open implementation of the MC family of maximum clique algorithms
  ☆12Updated 8 years ago
• xptree / LightNE
  ☆24Updated 3 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆88Updated 6 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆26Updated 4 years ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 years ago
• cmuparlay / pbbsbench
  New version of pbbs benchmarks
  ☆92Updated last year
• niklas-uhl / katric
  KaTric: scalable distributed-memory triangle counting made in Karlsruhe
  ☆13Updated last year
• lorenzhs / wrs
  Parallel Weighted Random Sampling
  ☆20Updated 4 years ago
• tomtseng / dynamic-connectivity-hdt
  Dynamic connectivity data structure by Holm, de Lichtenberg, and Thorup
  ☆20Updated last year
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆27Updated 2 years ago
• hu-macsy / dhb
  Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
  ☆12Updated 3 months ago
• THU-numbda / SketchNE
  Embedding billion-scale networks accurately in one hour (TKDE paper 2023)
  ☆11Updated last year
• LijunChang / MC-BRB
  Maximum clique computation over large sparse graphs
  ☆21Updated 3 years ago
• ciaranm / glasgow-subgraph-solver
  A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.
  ☆82Updated this week
• Cecca / ugraph
  Code and data for the Clustering Uncertain Graphs paper
  ☆10Updated 2 years ago
• jacobratkiewicz / webgraph
  Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)
  ☆31Updated 10 months ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆157Updated last year
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆26Updated 3 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆117Updated 3 months ago
• kittobi1992 / cluster_editing
  KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…
  ☆10Updated 2 years ago
• KarypisLab / TriangleCounting
  OpenMP-based parallel program for counting the number of triangles in a sparse graph
  ☆18Updated 7 years ago
• pkumod / GSI
  GPU-friendly Subgraph Isomorphism, published in ICDE 2020
  ☆33Updated last year
• MiviaLab / vf3lib
  VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
  ☆129Updated 2 years ago