Alternatives and similar repositories for butterfly-counting

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

• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  ☆1Updated 4 years ago
• anilpacaci / streaming-graph-partitioning
  Experimental Setup for Performance Analysis of Streaming Algorithms
  ☆31Updated 3 years ago
• 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"
  ☆25Updated 3 years ago
• guowentian / dynamicppr
  The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"
  ☆25Updated 7 years ago
• Xtra-Computing / ThunderRW
  Source code of "ThunderRW: An In-Memory Graph Random Walk Engine" published in VLDB'2021 - By Shixuan Sun, Yuhang Chen, Shengliang Lu, Bi…
  ☆26Updated 3 years ago
• wanghzccls / ExactSim
  Exact Single-Source SimRank Computation on Large Graphs
  ☆13Updated 4 years ago
• domargan / parallel-packed-csr
  A parallel packed CSR data structure for large-scale dynamic graphs
  ☆14Updated 2 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆30Updated last year
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆110Updated last year
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆24Updated last year
• uwsampa / graphbench
  A graph application benchmark suite
  ☆21Updated 9 years ago
• mayerrn / hybrid_edge_partitioner
  ☆18Updated 3 years ago
• concept-inversion / C-SAW
  A Framework for Graph Sampling and Random Walk on GPUs.
  ☆39Updated 3 months ago
• ustcadsl / GraphWalker
  ☆18Updated 4 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆26Updated 4 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
  ☆32Updated 2 weeks ago
• realstolz / powerlyra
  Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs
  ☆66Updated 3 years ago
• PerFuchs / gfe_driver
  C++ driver to evaluate updates and analytics on dynamic structural graphs
  ☆27Updated 3 years ago
• wheatman / Packed-Memory-Array
  ☆17Updated 5 months ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆87Updated 5 years ago
• fabiopetroni / VGP
  A software package for one-pass Vertex-cut balanced Graph Partitioning.
  ☆30Updated 9 years ago
• jshun / ppopp20-ae
  ☆17Updated 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
• HPCGraphAnalysis / PuLP
  ☆24Updated 2 years ago
• spcl / gms
  GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning
  ☆26Updated 3 years ago
• xiangyuzhi / GraphStorageExp
  ☆11Updated 11 months ago
• Xtra-Computing / ForkGraph
  ☆17Updated 3 years ago
• ansrlab / edgepart
  Graph edge partitioning algorithms
  ☆45Updated 5 years ago
• iHeartGraph / iBFS
  iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16
  ☆24Updated 7 years ago