Alternatives and similar repositories for Near-Maximum-Independent-Set

Users that are interested in Near-Maximum-Independent-Set are comparing it to the libraries listed below

• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆25Updated 3 years ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆38Updated this week
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆74Updated last month
• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆208Updated 5 months ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• wata-orz / vertex_cover
  vertex cover solver
  ☆30Updated 5 years ago
• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  ☆1Updated 4 years ago
• masatoshihanai / DistributedNE
  Trillion-edge Scale Graph Edge Partitioning
  ☆27Updated 5 years ago
• wheatman / Packed-Memory-Array
  ☆17Updated 5 months ago
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆15Updated 5 years ago
• lorenzhs / wrs
  Parallel Weighted Random Sampling
  ☆20Updated 4 years ago
• queryproc / optimizing-subgraph-queries-combining-binary-and-worst-case-optimal-joins
  Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19
  ☆32Updated 3 weeks ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆26Updated 4 years ago
• ansrlab / edgepart
  Graph edge partitioning algorithms
  ☆45Updated 5 years ago
• KarlsruheMIS / pace-2019
  Winning Solver of PACE Challenge 2019 Track A
  ☆13Updated 3 years ago
• guowentian / dynamicppr
  The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"
  ☆25Updated 7 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆30Updated last year
• beginner1010 / butterfly-counting
  The source code for BUTTERFLY COUNTING IN BIPARTITE NETWORKS
  ☆12Updated 5 years ago
• datourat / Gorder
  ☆36Updated 5 years ago
• LijunChang / MC-BRB
  Maximum clique computation over large sparse graphs
  ☆19Updated 3 years ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆24Updated last year
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆87Updated 5 years ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 years ago
• KarypisLab / K-Truss
  OpenMP-based parallel software for computing the truss decomposition of a graph.
  ☆14Updated 7 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆116Updated 2 months ago
• iHeartGraph / iBFS
  iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16
  ☆24Updated 7 years ago
• wanghzccls / ExactSim
  Exact Single-Source SimRank Computation on Large Graphs
  ☆13Updated 4 years ago
• ehab-abdelhamid / ScaleMine
  Parallel Frequent Subgraph Mining
  ☆31Updated 7 years ago
• Xtra-Computing / G3
  G3: A Programmable GNN Training System on GPU
  ☆43Updated 4 years ago