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

• KaHIP / KaHIP
  KaHIP -- Karlsruhe HIGH Quality Partitioning.
  ☆463Updated 2 weeks ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆214Updated 3 months ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆28Updated 2 years ago
• ansrlab / edgepart
  Graph edge partitioning algorithms
  ☆48Updated 6 years ago
• LijunChang / MC-BRB
  Maximum clique computation over large sparse graphs
  ☆23Updated 3 years ago
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆109Updated 2 years ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 years ago
• datourat / Gorder
  ☆39Updated 6 years ago
• guowentian / dynamicppr
  The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"
  ☆25Updated 7 years ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆26Updated 3 years ago
• masatoshihanai / DistributedNE
  Trillion-edge Scale Graph Edge Partitioning
  ☆30Updated 6 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆31Updated last year
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆121Updated 8 months ago
• groute / groute
  Asynchronous Multi-GPU Programming Framework
  ☆47Updated 4 years ago
• jshun / ligra
  Ligra: A Lightweight Graph Processing Framework for Shared Memory
  ☆481Updated last year
• wanghzccls / ExactSim
  Exact Single-Source SimRank Computation on Large Graphs
  ☆13Updated 5 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆25Updated 4 years ago
• desert0616 / gpma_demo
  Source code for the paper: Accelerating Dynamic Graph Analytics on GPUs
  ☆28Updated 2 years ago
• HPCGraphAnalysis / PuLP
  ☆26Updated 3 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆159Updated 2 years ago
• wheatman / Packed-Memory-Array
  ☆25Updated 11 months ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆90Updated 6 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
  ☆33Updated 6 months ago
• anilpacaci / streaming-graph-partitioning
  Experimental Setup for Performance Analysis of Streaming Algorithms
  ☆32Updated 3 years ago
• zongshenmu / GraphPartitioners
  Graph Partitioning for Large-scale Graph Datasets
  ☆97Updated 3 years ago
• xiechenny / powerswitch
  PowerSwitch: a adaptive mode switch engine for distributed parrallel graph computation
  ☆16Updated 11 years ago
• farkhor / CuSha
  CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.
  ☆53Updated 10 years ago
• thu-pacman / GridGraph
  Out-of-core graph processing on a single machine.
  ☆130Updated 7 years ago
• Xtra-Computing / Medusa
  Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code
  ☆63Updated 5 years ago