Alternatives and similar repositories for MC-BRB

Users that are interested in MC-BRB are comparing it to the libraries listed below

• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆79Updated 6 years ago
• Gawssin / kCliqueListing
  a k-cliques algorithm
  ☆19Updated 3 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆26Updated 4 years ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 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…
  ☆50Updated 2 years ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆26Updated 3 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆157Updated last year
• guowentian / dynamicppr
  The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"
  ☆25Updated 7 years ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 3 years ago
• greyfoxamine / Overlapping-Community-Detection-Using-Seed-Set-Expansion-
  ☆8Updated 8 years ago
• wanghzccls / ExactSim
  Exact Single-Source SimRank Computation on Large Graphs
  ☆13Updated 4 years ago
• GemsLab / StrucEmbedding-GraphLibrary
  The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.
  ☆18Updated 2 years ago
• HKUST-KnowComp / NeuralSubgraphCounting
  Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"
  ☆54Updated 11 months ago
• wangsibovictor / fora
  FORA: Simple and Effective Approximate Single-Source Personalized Pagerank
  ☆31Updated 4 years ago
• JackChuengQAQ / SubgraphMatchingSurvey
  The source code of "A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction"
  ☆13Updated 9 months ago
• athomo / kcore
  ☆12Updated 7 years ago
• ZongyueQin / Graph-Hashing
  ☆16Updated 4 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆30Updated last year
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆11Updated 5 years ago
• GraphPKU / I2GNN
  official code for I2GNN.
  ☆13Updated 2 years ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆27Updated 2 years ago
• ansrlab / edgepart
  Graph edge partitioning algorithms
  ☆46Updated 5 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
• Kangfei / LSS
  Released code for [sigmod'21] A learned Sketch for Subgraph Counting
  ☆19Updated 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…
  ☆30Updated 2 years ago
• mayerrn / hybrid_edge_partitioner
  ☆18Updated 3 years ago
• anilpacaci / streaming-graph-partitioning
  Experimental Setup for Performance Analysis of Streaming Algorithms
  ☆31Updated 3 years ago
• young917 / www21-hyperlap
  WWW21 - How Do Hyperedges Overlap
  ☆16Updated 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
• KarypisLab / K-Truss
  OpenMP-based parallel software for computing the truss decomposition of a graph.
  ☆14Updated 7 years ago