Alternatives and similar repositories for open-mcs

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

• jwalteros / dOmega
  Library for finding maximum cliques on graphs
  ☆17Updated 4 years ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆41Updated last week
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆79Updated 2 weeks ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆31Updated last year
• KaHIP / KaHIP
  KaHIP -- Karlsruhe HIGH Quality Partitioning.
  ☆473Updated 2 weeks ago
• moorejs / APSP-in-parallel
  Solving All Pairs Shortest Paths with Floyd Warshall's Algorithm and Johnson's Algorithm, using OpenMP and CUDA
  ☆33Updated 7 years ago
• kahypar / kahypar
  KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…
  ☆508Updated 3 weeks ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆26Updated 3 years ago
• domargan / parallel-packed-csr
  A parallel packed CSR data structure for large-scale dynamic graphs
  ☆13Updated 3 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆25Updated 4 years ago
• jacobratkiewicz / webgraph
  Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)
  ☆33Updated last year
• networkx / networkx-metis
  NetworkX Addon to allow graph partitioning with METIS
  ☆80Updated 2 years ago
• Xtra-Computing / G3
  G3: A Programmable GNN Training System on GPU
  ☆43Updated 5 years ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆18Updated 7 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆164Updated 2 years ago
• gunrock / mini
  mini is mini
  ☆20Updated 6 years ago
• athomo / kcore
  ☆12Updated 8 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆90Updated 6 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆216Updated last month
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆88Updated 6 years ago
• domargan / awesome-dynamic-graphs
  A collection of resources on dynamic/streaming/temporal/evolving graph processing systems, databases, data structures, datasets, and rela…
  ☆145Updated 2 years ago
• bindscha / x-stream
  Edge-centric Graph Processing System using Streaming Partitions
  ☆82Updated 8 years ago
• RapidsAtHKUST / AccTrussDecomposition
  Source code of "Accelerating Truss Decomposition on Heterogeneous Processors", accepted by VLDB'20 - By Yulin Che, Zhuohang Lai, Shixuan …
  ☆16Updated 5 years ago
• MiviaLab / vf3lib
  VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
  ☆137Updated 5 months ago
• arjun-menon / Distributed-Graph-Algorithms
  🌳 A collection of distributed graph algorithms, implemented in Python/DistAlgo
  ☆67Updated 6 years ago
• renault-iaa / challenge-roadef-2022
  challenge EURO/ROADEF 2022 on RENAULT's truck loading : documents and issues
  ☆31Updated 2 years ago
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆80Updated 7 years ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆29Updated 2 years ago
• MaxiBoether / mis-benchmark-framework
  A benchmarking suite for maximum independent set solvers.
  ☆52Updated 2 years ago
• dnasc / graph-processing
  This repository contains information about graph processing.
  ☆32Updated last year