Alternatives and similar repositories for butterfly-counting

Users that are interested in butterfly-counting are comparing it to the libraries listed below

• wangsibovictor / fora
  FORA: Simple and Effective Approximate Single-Source Personalized Pagerank
  ☆31Updated 4 years ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆26Updated 3 years ago
• anilpacaci / streaming-graph-partitioning
  Experimental Setup for Performance Analysis of Streaming Algorithms
  ☆31Updated 3 years ago
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆109Updated 2 years ago
• guowentian / dynamicppr
  The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"
  ☆25Updated 7 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆159Updated last year
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆26Updated 4 years ago
• Xtra-Computing / ForkGraph
  ☆17Updated 3 years ago
• domargan / awesome-dynamic-graphs
  A collection of resources on dynamic/streaming/temporal/evolving graph processing systems, databases, data structures, datasets, and rela…
  ☆140Updated 2 years ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆27Updated 2 years ago
• wheatman / Packed-Memory-Array
  ☆24Updated 9 months ago
• concept-inversion / C-SAW
  A Framework for Graph Sampling and Random Walk on GPUs.
  ☆38Updated 7 months ago
• ehab-abdelhamid / GraMi
  GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of ma…
  ☆116Updated last year
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 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
• wanghzccls / ExactSim
  Exact Single-Source SimRank Computation on Large Graphs
  ☆13Updated 4 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
• mayerrn / hybrid_edge_partitioner
  ☆18Updated 4 years ago
• domargan / parallel-packed-csr
  A parallel packed CSR data structure for large-scale dynamic graphs
  ☆13Updated 2 years ago
• dccspeed / fractal
  ☆28Updated 11 months ago
• fabiopetroni / VGP
  A software package for one-pass Vertex-cut balanced Graph Partitioning.
  ☆32Updated 10 years ago
• xiangyuzhi / GraphStorageExp
  ☆12Updated last year
• dsg-uwaterloo / s-graffito
  ☆13Updated 10 months ago
• jshun / ppopp20-ae
  ☆17Updated 5 years ago
• 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
  ☆33Updated 4 months ago
• saurabhdash / GCN_Partitioning
  Graph Partitoning Using Graph Convolutional Networks
  ☆65Updated 3 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆31Updated last year
• xibosun / paper_list
  The repo lists papers of various areas, including Graph Analytics, Graph Acceleration, Subgraph Matching, Streaming Graph Management, Wor…
  ☆17Updated 4 years ago
• CGCL-codes / Pensieve
  Pensieve is a skewness-aware multi-version graph processing system that exploits the time locality of graph version access and leverages …
  ☆21Updated 4 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆87Updated 6 years ago