Alternatives and similar repositories for open-mcs:

Users that are interested in open-mcs are comparing it to the libraries listed below

• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 2 years ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆37Updated 2 weeks ago
• jwalteros / dOmega
  Library for finding maximum cliques on graphs
  ☆15Updated 3 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆25Updated 3 years ago
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆76Updated 6 years ago
• RapidsAtHKUST / ContinuousSubgraphMatching
  Source code and datasets of "An In-Depth Study of Continuous Subgraph Matching", accepted by VLDB'22 - By Xibo Sun, Dr. Shixuan Sun, Prof…
  ☆46Updated last year
• 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 years ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆24Updated 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
• zakimjz / DistGraph
  Distributed Graph Mining on a Massive "Single" Graph
  ☆14Updated 4 years ago
• domargan / parallel-packed-csr
  A parallel packed CSR data structure for large-scale dynamic graphs
  ☆14Updated 2 years ago
• ParAlg / CPAM
  CPAM: Compressed Parallel Augmented Maps
  ☆23Updated 4 months ago
• ciaranm / glasgow-subgraph-solver
  A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.
  ☆72Updated last week
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆29Updated 10 months ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆201Updated 2 months ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆87Updated 5 years ago
• humayunk1 / PKC
  Parallel k-core Decomposition on Multicore Platforms
  ☆11Updated 4 years ago
• bindscha / x-stream
  Edge-centric Graph Processing System using Streaming Partitions
  ☆81Updated 7 years ago
• chenxuhao / GraphAIBench
  A benchmark suite for Graph Machine Learning
  ☆18Updated 4 months ago
• athomo / kcore
  ☆11Updated 7 years ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆24Updated last year
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆73Updated 3 months ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  Updated 3 years ago
• RapidsAtHKUST / AccTrussDecomposition
  Source code of "Accelerating Truss Decomposition on Heterogeneous Processors", accepted by VLDB'20 - By Yulin Che, Zhuohang Lai, Shixuan …
  ☆16Updated 4 years ago
• iHeartGraph / iBFS
  iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16
  ☆23Updated 7 years ago
• Xtra-Computing / ForkGraph
  ☆17Updated 3 years ago
• kahypar / mt-kahypar
  Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…
  ☆138Updated last week
• uwsampa / graphbench
  A graph application benchmark suite
  ☆21Updated 9 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆150Updated last year