Alternatives and similar repositories for katric:

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

• 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
• hu-macsy / dhb
  Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
  ☆12Updated last month
• molaupi / karri
  Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.
  ☆12Updated 2 weeks ago
• marvinwilliams / multiqueue
  ☆17Updated last month
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆38Updated 2 months ago
• KarlsruheMIS / pace-2019
  Winning Solver of PACE Challenge 2019 Track A
  ☆13Updated 3 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
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆15Updated 5 years ago
• ReStoreCpp / ReStore
  REplicated STORagE
  ☆13Updated 2 years ago
• kamping-site / kamping
  KaMPIng: (Near) zero-overhead MPI wrapper for modern C++
  ☆50Updated last month
• ByteHamster / PaCHash
  Packed and Compressed Hash Tables
  ☆15Updated last month
• KaHIP / KaMinPar
  Shared-Memory and Distributed-Memory Parallel Graph Partitioning
  ☆38Updated last week
• kahypar / mt-kahypar
  Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…
  ☆140Updated this week
• ByteHamster / GpuRecSplit
  Parallel space-efficient minimal perfect hash function on SIMD and GPU
  ☆14Updated last month
• wheatman / Packed-Memory-Array
  ☆17Updated 4 months ago
• lorenzhs / wrs
  Parallel Weighted Random Sampling
  ☆20Updated 4 years ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆208Updated 4 months ago
• bingmann / sqlplot-tools
  Generate pgfplots or gnuplots from embedded SQL statements
  ☆27Updated 8 months ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆25Updated last month
• mayerrn / HYPE
  Implementation of the HYPE hypergraph partitioner.
  ☆19Updated 5 years ago
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆19Updated last month
• VieClus / VieClus
  Vienna Graph Clustering
  ☆16Updated 3 months ago
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆74Updated last month
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 3 years ago
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆30Updated last month
• sacabench / sacabench
  Implementation of the sacabench framework
  ☆17Updated 3 years ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆31Updated 3 months ago
• larsgottesbueren / gp-ann
  Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"
  ☆22Updated 6 months ago
• syhlalala / PAM-AE
  ☆9Updated 6 years ago