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
• jwalteros / dOmega
  Library for finding maximum cliques on graphs
  ☆15Updated 3 years ago
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆76Updated 6 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆25Updated 3 years ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆35Updated last week
• LijunChang / MC-BRB
  Maximum clique computation over large sparse graphs
  ☆19Updated 2 years ago
• mabseher / htd
  A small but efficient C++ library for computing (customized) tree and hypertree decompositions.
  ☆50Updated last year
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆28Updated 9 months ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆24Updated 2 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 5 years ago
• domargan / parallel-packed-csr
  A parallel packed CSR data structure for large-scale dynamic graphs
  ☆14Updated 2 years ago
• veluca93 / parallel_enum
  A tool for parallel and distributed enumeration of cliques and diameter two kplexes.
  ☆14Updated 2 years ago
• RapidsAtHKUST / AccTrussDecomposition
  Source code of "Accelerating Truss Decomposition on Heterogeneous Processors", accepted by VLDB'20 - By Yulin Che, Zhuohang Lai, Shixuan …
  ☆14Updated 4 years ago
• lorenzhs / wrs
  Parallel Weighted Random Sampling
  ☆19Updated 4 years ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆21Updated last year
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆73Updated 2 months ago
• Xtra-Computing / PathEnum
  Source code of "PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration", published in SIGMOD'2021 - By Shixuan Sun, Yuhang Chen…
  ☆14Updated 3 years ago
• iHeartGraph / iBFS
  iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16
  ☆23Updated 7 years ago
• mayerrn / HYPE
  Implementation of the HYPE hypergraph partitioner.
  ☆18Updated 5 years ago
• alex-87 / HyperGraphLib
  C++ Hypergraph modelling Library using Boost and OpenMP with some algorithms, including isomorphism using Gecode.
  ☆21Updated 2 years ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆11Updated 4 years ago
• chenxuhao / GraphMiner
  Graph Pattern Mining
  ☆88Updated 3 months ago
• spcl / gms
  GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning
  ☆25Updated 3 years ago
• wheatman / Packed-Memory-Array
  ☆15Updated last month
• 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
• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  ☆0Updated 3 years ago
• shixuansun / RapidFlow
  Source code of "RapidFlow: An Efficient Approach to Continuous Subgraph Matching" published in VLDB'2022 - By Shixuan Sun, Xibo Sun, Bing…
  ☆29Updated 2 years ago
• Gecode / MPG
  Modeling and Programming with Gecode
  ☆45Updated 2 years ago