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

• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  ☆1Updated 4 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆211Updated 7 months ago
• syhlalala / PAM-AE
  ☆9Updated 6 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 / pbbslib
  ☆25Updated 4 years ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆26Updated 3 years ago
• ehab-abdelhamid / ScaleMine
  Parallel Frequent Subgraph Mining
  ☆31Updated 7 years ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆40Updated 2 weeks ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆28Updated 2 years ago
• wanghzccls / ExactSim
  Exact Single-Source SimRank Computation on Large Graphs
  ☆13Updated 4 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆26Updated 4 years ago
• guowentian / dynamicppr
  The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"
  ☆25Updated 7 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆88Updated 6 years ago
• Xtra-Computing / Medusa
  Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code
  ☆62Updated 4 years ago
• narayanan2004 / GraphMat
  GraphMat graph analytics framework
  ☆102Updated 2 years ago
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆14Updated 5 years ago
• masatoshihanai / DistributedNE
  Trillion-edge Scale Graph Edge Partitioning
  ☆27Updated 5 years ago
• KaHIP / KaHIP
  KaHIP -- Karlsruhe HIGH Quality Partitioning.
  ☆440Updated 2 months ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆29Updated last year
• farkhor / CuSha
  CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.
  ☆52Updated 9 years ago
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆109Updated last year
• iHeartGraph / Enterprise
  Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.
  ☆31Updated 8 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆157Updated last year
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆117Updated 4 months 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
  ☆33Updated 2 months ago
• xvz / graph-processing
  Comparison of graph processing systems.
  ☆23Updated 8 years ago
• cmu-sei / gbtl
  GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org
  ☆134Updated 2 years ago
• Adam27X / hybrid_BC
  Hybrid methods for Parallel Betweenness Centrality on the GPU
  ☆24Updated 6 years ago
• wata-orz / vertex_cover
  vertex cover solver
  ☆30Updated 5 years ago
• wheatman / Packed-Memory-Array
  ☆20Updated 7 months ago