Alternatives and similar repositories for dynamicppr

Users that are interested in dynamicppr are comparing it to the libraries listed below

• anilpacaci / streaming-graph-partitioning
  Experimental Setup for Performance Analysis of Streaming Algorithms
  ☆31Updated 3 years ago
• concept-inversion / C-SAW
  A Framework for Graph Sampling and Random Walk on GPUs.
  ☆39Updated 4 months ago
• wangsibovictor / fora
  FORA: Simple and Effective Approximate Single-Source Personalized Pagerank
  ☆31Updated 4 years ago
• mayerrn / hybrid_edge_partitioner
  ☆18Updated 3 years ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆26Updated 3 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
• fabiopetroni / VGP
  A software package for one-pass Vertex-cut balanced Graph Partitioning.
  ☆31Updated 9 years ago
• xiangyuzhi / GraphStorageExp
  ☆11Updated last year
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆25Updated last year
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆110Updated last year
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆30Updated last year
• ansrlab / edgepart
  Graph edge partitioning algorithms
  ☆45Updated 5 years ago
• guowentian / SubgraphMatchGPU
  ☆29Updated 4 years ago
• HPCGraphAnalysis / PuLP
  ☆24Updated 2 years ago
• PASSIONLab / CAGNET
  ☆45Updated last month
• wheatman / Packed-Memory-Array
  ☆17Updated 5 months ago
• plasma-umass / NextDoor
  Graph Sampling using GPU
  ☆52Updated 3 years ago
• iDC-NEU / HyTGraph
  HyTGraph: GPU-Accelerated Graph Processing with Hybrid Transfer Management
  ☆20Updated 2 years ago
• Xtra-Computing / G3
  G3: A Programmable GNN Training System on GPU
  ☆43Updated 4 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
• datourat / Gorder
  ☆37Updated 5 years ago
• thu-pacman / GraphPi
  ☆40Updated 3 years ago
• MITIBMxGraph / SALIENT
  The official SALIENT system described in the paper "Accelerating Training and Inference of Graph Neural Networks with Fast Sampling and P…
  ☆40Updated last year
• zakimjz / DistGraph
  Distributed Graph Mining on a Massive "Single" Graph
  ☆15Updated 5 years ago
• pkumod / GSI
  GPU-friendly Subgraph Isomorphism, published in ICDE 2020
  ☆34Updated 11 months ago
• Team309 / awesome-graph-processing
  A collection of awesome papers about graph processing.
  ☆15Updated 5 years ago
• ustcadsl / GraphWalker
  ☆18Updated 4 years ago
• AutomataLab / Subway
  Out-of-GPU-Memory Graph Processing with Minimal Data Transfer
  ☆53Updated 2 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