Alternatives and similar repositories for dynamic-connectivity-hdt

Users that are interested in dynamic-connectivity-hdt are comparing it to the libraries listed below

• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆212Updated 2 weeks ago
• cmuparlay / parlaylib
  A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines
  ☆371Updated 3 months ago
• GT-TDAlab / PIGO
  Parallel Graph Input Output
  ☆20Updated 2 years ago
• KaHIP / KaHIP
  KaHIP -- Karlsruhe HIGH Quality Partitioning.
  ☆443Updated 4 months ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆28Updated 2 years ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• wheatman / Packed-Memory-Array
  ☆24Updated 8 months ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆19Updated 3 years ago
• masatoshihanai / DistributedNE
  Trillion-edge Scale Graph Edge Partitioning
  ☆28Updated 5 years ago
• jwalteros / dOmega
  Library for finding maximum cliques on graphs
  ☆16Updated 3 years ago
• guowentian / dynamicppr
  The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"
  ☆25Updated 7 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
• MiviaLab / vf3lib
  VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
  ☆133Updated last month
• ParAlg / ParGeo
  ☆47Updated 2 years ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆26Updated 3 years ago
• athomo / kcore
  ☆12Updated 8 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆159Updated last year
• shixuansun / RapidFlow
  Source code of "RapidFlow: An Efficient Approach to Continuous Subgraph Matching" published in VLDB'2022 - By Shixuan Sun, Xibo Sun, Bing…
  ☆32Updated 3 years ago
• omarobeya / parallel-inplace-radixsort
  ☆21Updated 4 years ago
• Lucaweihs / range-tree
  A C++ RangeTree implementation.
  ☆43Updated 5 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆31Updated last year
• ansrlab / edgepart
  Graph edge partitioning algorithms
  ☆46Updated 5 years ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆42Updated last week
• KarypisLab / TriangleCounting
  OpenMP-based parallel program for counting the number of triangles in a sparse graph
  ☆18Updated last month
• mtodat / ms-bfs
  Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"
  ☆25Updated 9 years ago
• HPCGraphAnalysis / PuLP
  ☆24Updated 2 years ago
• lorenzhs / wrs
  Parallel Weighted Random Sampling
  ☆19Updated 4 years ago
• iHeartGraph / Enterprise
  Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.
  ☆31Updated 8 years ago
• mayerrn / hybrid_edge_partitioner
  ☆18Updated 3 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆88Updated 6 years ago