Alternatives and similar repositories for wrs

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

• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆213Updated 2 months ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆31Updated last year
• wheatman / Packed-Memory-Array
  ☆25Updated 10 months ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆88Updated 6 years ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆27Updated 2 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆119Updated 6 months ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• ParAlg / CPAM
  CPAM: Compressed Parallel Augmented Maps
  ☆25Updated last month
• spcl / gms
  GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning
  ☆25Updated 4 years ago
• domargan / parallel-packed-csr
  A parallel packed CSR data structure for large-scale dynamic graphs
  ☆13Updated 2 years ago
• reddragon / packed-memory-array
  A simple implementation of the packed memory array
  ☆20Updated 12 years ago
• datourat / Gorder
  ☆39Updated 6 years ago
• bindscha / x-stream
  Edge-centric Graph Processing System using Streaming Partitions
  ☆82Updated 7 years ago
• HPCGraphAnalysis / PuLP
  ☆25Updated 2 years ago
• hornet-gt / hornet
  Hornet data structure for sparse dynamic graphs and matrices
  ☆88Updated 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 5 months ago
• farkhor / PaRMAT
  Multi-threaded Large-Scale RMAT Graph Generator.
  ☆129Updated 2 years ago
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆109Updated 2 years ago
• pabmont / pma
  Packed Memory Array
  ☆17Updated 11 years ago
• Xtra-Computing / G3
  G3: A Programmable GNN Training System on GPU
  ☆43Updated 5 years ago
• xiangyuzhi / GraphStorageExp
  ☆12Updated last year
• ansrlab / edgepart
  Graph edge partitioning algorithms
  ☆47Updated 5 years ago
• hu-macsy / dhb
  Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
  ☆12Updated last month
• pkumod / GraphSetIntersection
  Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…
  ☆30Updated 6 years ago
• jshun / ppopp20-ae
  ☆17Updated 5 years ago
• concept-inversion / C-SAW
  A Framework for Graph Sampling and Random Walk on GPUs.
  ☆38Updated 8 months ago
• cwida / teseo
  A C++ library for the analysis of structural dynamic graphs
  ☆27Updated 3 years ago
• Xtra-Computing / ForkGraph
  ☆17Updated 3 years ago
• the-data-lab / GraphOne
  "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19
  ☆59Updated 4 years ago