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
  ☆19Updated 3 years ago
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆78Updated 2 months ago
• KarlsruheMIS / pace-2019
  Winning Solver of PACE Challenge 2019 Track A
  ☆13Updated 4 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆212Updated last month
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆159Updated 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 last week
• Cecca / ugraph
  Code and data for the Clustering Uncertain Graphs paper
  ☆10Updated 2 years ago
• guowentian / dynamicppr
  The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"
  ☆25Updated 7 years ago
• jshun / ligra
  Ligra: A Lightweight Graph Processing Framework for Shared Memory
  ☆477Updated last year
• KaHIP / KaHIP
  KaHIP -- Karlsruhe HIGH Quality Partitioning.
  ☆447Updated 4 months ago
• wata-orz / steiner_tree
  Steiner tree solver
  ☆30Updated 7 years ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆26Updated 4 years ago
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆109Updated 2 years ago
• wangsibovictor / fora
  FORA: Simple and Effective Approximate Single-Source Personalized Pagerank
  ☆31Updated 4 years ago
• HPCGraphAnalysis / PuLP
  ☆24Updated 2 years ago
• iwiwi / pruned-landmark-labeling
  Fast and exact shortest-path distance querying index
  ☆90Updated 11 years ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆42Updated last month
• MiviaLab / vf3lib
  VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
  ☆134Updated last week
• wzskytop / TopPPR
  Codes for TopPPR
  ☆14Updated 6 years ago
• masatoshihanai / DistributedNE
  Trillion-edge Scale Graph Edge Partitioning
  ☆28Updated 5 years ago
• wheatman / Packed-Memory-Array
  ☆24Updated 9 months ago
• anilpacaci / streaming-graph-partitioning
  Experimental Setup for Performance Analysis of Streaming Algorithms
  ☆31Updated 3 years ago
• niklas-uhl / katric
  KaTric: scalable distributed-memory triangle counting made in Karlsruhe
  ☆13Updated 2 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆31Updated last year
• 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
• mayerrn / hybrid_edge_partitioner
  ☆18Updated 3 years ago
• ansrlab / edgepart
  Graph edge partitioning algorithms
  ☆46Updated 5 years ago
• lorenzhs / wrs
  Parallel Weighted Random Sampling
  ☆19Updated 4 years ago