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
  ☆15Updated 3 years ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 3 years ago
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆77Updated 2 months ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆26Updated 3 years ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆39Updated last month
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆26Updated 4 years ago
• mabseher / htd
  A small but efficient C++ library for computing (customized) tree and hypertree decompositions.
  ☆55Updated last year
• wata-orz / vertex_cover
  vertex cover solver
  ☆30Updated 5 years ago
• LijunChang / MC-BRB
  Maximum clique computation over large sparse graphs
  ☆21Updated 3 years ago
• hu-macsy / dhb
  Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
  ☆12Updated 3 months ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆88Updated 6 years ago
• xibosun / paper_list
  The repo lists papers of various areas, including Graph Analytics, Graph Acceleration, Subgraph Matching, Streaming Graph Management, Wor…
  ☆16Updated 4 years ago
• domargan / parallel-packed-csr
  A parallel packed CSR data structure for large-scale dynamic graphs
  ☆14Updated 2 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆157Updated last year
• athomo / kcore
  ☆12Updated 7 years ago
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆79Updated 6 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆30Updated last year
• 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
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 years ago
• ciaranm / glasgow-subgraph-solver
  A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.
  ☆82Updated this week
• jacobratkiewicz / webgraph
  Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)
  ☆31Updated 10 months ago
• ParAlg / CPAM
  CPAM: Compressed Parallel Augmented Maps
  ☆25Updated 8 months ago
• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• veluca93 / parallel_enum
  A tool for parallel and distributed enumeration of cliques and diameter two kplexes.
  ☆14Updated 2 years ago
• Gawssin / kCliqueListing
  a k-cliques algorithm
  ☆19Updated 3 years ago
• ansrlab / edgepart
  Graph edge partitioning algorithms
  ☆46Updated 5 years ago
• mayerrn / HYPE
  Implementation of the HYPE hypergraph partitioner.
  ☆21Updated 5 years ago
• kittobi1992 / cluster_editing
  KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…
  ☆10Updated 2 years ago
• RapidsAtHKUST / RapidMatch
  Source code and datasets of "RapidMatch: A Holistic Approach to Subgraph Query Processing", accepted by VLDB'21 - By Shixuan Sun, Xibo Su…
  ☆33Updated 2 years ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆27Updated 2 years ago