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

• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  Updated 4 years ago
• domargan / parallel-packed-csr
  A parallel packed CSR data structure for large-scale dynamic graphs
  ☆14Updated 2 years ago
• wanghzccls / ExactSim
  Exact Single-Source SimRank Computation on Large Graphs
  ☆13Updated 4 years ago
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆73Updated 2 weeks ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆25Updated 3 years ago
• wata-orz / vertex_cover
  vertex cover solver
  ☆30Updated 5 years ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆37Updated last month
• KarlsruheMIS / pace-2019
  Winning Solver of PACE Challenge 2019 Track A
  ☆13Updated 3 years ago
• ansrlab / edgepart
  Graph edge partitioning algorithms
  ☆45Updated 5 years ago
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆15Updated 5 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆206Updated 4 months ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• iHeartGraph / iBFS
  iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16
  ☆24Updated 7 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆26Updated 4 years ago
• masatoshihanai / DistributedNE
  Trillion-edge Scale Graph Edge Partitioning
  ☆27Updated 5 years ago
• wheatman / Packed-Memory-Array
  ☆17Updated 4 months ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆24Updated last year
• LijunChang / MC-BRB
  Maximum clique computation over large sparse graphs
  ☆19Updated 3 years ago
• HPCGraphAnalysis / PuLP
  ☆24Updated 2 years ago
• marvinwilliams / multiqueue
  ☆17Updated last month
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆87Updated 5 years ago
• mayerrn / hybrid_edge_partitioner
  ☆18Updated 3 years ago
• datourat / Gorder
  ☆35Updated 5 years ago
• zakimjz / DistGraph
  Distributed Graph Mining on a Massive "Single" Graph
  ☆15Updated 5 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
• xiechenny / powerswitch
  PowerSwitch: a adaptive mode switch engine for distributed parrallel graph computation
  ☆16Updated 11 years ago
• pkumod / GraphSetIntersection
  Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…
  ☆30Updated 6 years ago
• KarypisLab / TriangleCounting
  OpenMP-based parallel program for counting the number of triangles in a sparse graph
  ☆18Updated 7 years ago