Alternatives and similar repositories for dhb

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

• niklas-uhl / katric
  KaTric: scalable distributed-memory triangle counting made in Karlsruhe
  ☆14Updated 2 years ago
• kamping-site / kassert
  Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…
  ☆11Updated 2 months ago
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆14Updated 5 years ago
• molaupi / karri
  Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.
  ☆13Updated 3 weeks ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆42Updated 3 weeks ago
• marvinwilliams / multiqueue
  ☆17Updated 7 months ago
• KaHIP / KaMinPar
  Shared-Memory and Distributed-Memory Parallel Graph Partitioning
  ☆44Updated this week
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆31Updated last year
• kahypar / mt-kahypar
  Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…
  ☆163Updated this week
• wheatman / Packed-Memory-Array
  ☆25Updated 10 months ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆213Updated 2 months ago
• mayerrn / HYPE
  Implementation of the HYPE hypergraph partitioner.
  ☆22Updated 5 years ago
• KaHIP / KaHIP
  KaHIP -- Karlsruhe HIGH Quality Partitioning.
  ☆462Updated 6 months ago
• lorenzhs / wrs
  Parallel Weighted Random Sampling
  ☆19Updated 4 years ago
• kittobi1992 / cluster_editing
  KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…
  ☆10Updated 2 years ago
• reddragon / packed-memory-array
  A simple implementation of the packed memory array
  ☆20Updated 12 years ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆28Updated 2 years ago
• ReStoreCpp / ReStore
  REplicated STORagE
  ☆13Updated 2 years ago
• omarobeya / parallel-inplace-radixsort
  ☆22Updated 4 years ago
• masatoshihanai / DistributedNE
  Trillion-edge Scale Graph Edge Partitioning
  ☆30Updated 6 years ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• kahypar / kahypar
  KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…
  ☆489Updated last week
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆89Updated 6 years ago
• KarlsruheMIS / pace-2019
  Winning Solver of PACE Challenge 2019 Track A
  ☆13Updated 4 years ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• notini / csr-formatter
  C++ package to store Matrix Market (.mtx) file format sparse matrices in Compressed Row Storage (CSR) format.
  ☆16Updated 6 years ago
• IntelligentSoftwareSystems / Galois
  Galois: C++ library for multi-core and multi-node parallelization
  ☆342Updated last year
• DIR-LAB / VCSR
  Official code of our work, VCSR: Mutable CSR Graph Format Using Vertex-Centric Packed Memory Array [CCGrid 2022].
  ☆12Updated 3 years ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆19Updated 3 years ago
• iHeartGraph / Enterprise
  Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.
  ☆31Updated 8 years ago