Alternatives and similar repositories for KaMinPar:

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

• kamping-site / kamping
  KaMPIng: (Near) zero-overhead MPI wrapper for modern C++
  ☆46Updated last week
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆37Updated 3 weeks ago
• kahypar / mt-kahypar
  Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…
  ☆138Updated last week
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆15Updated 5 years ago
• mayerrn / HYPE
  Implementation of the HYPE hypergraph partitioner.
  ☆19Updated 5 years ago
• niklas-uhl / katric
  KaTric: scalable distributed-memory triangle counting made in Karlsruhe
  ☆13Updated last year
• Algebraic-Programming / ALP
  Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…
  ☆25Updated last week
• marvinwilliams / multiqueue
  ☆17Updated last week
• ParAlg / CPAM
  CPAM: Compressed Parallel Augmented Maps
  ☆23Updated 5 months ago
• wheatman / Packed-Memory-Array
  ☆17Updated 3 months ago
• hu-macsy / dhb
  Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
  ☆12Updated 4 months ago
• cmuparlay / pbbsbench
  New version of pbbs benchmarks
  ☆85Updated 9 months ago
• PASSIONLab / CombBLAS
  The Combinatorial BLAS (CombBLAS) is an extensible distributed-memory parallel graph library offering a small but powerful set of linear …
  ☆71Updated this week
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆29Updated 4 months ago
• KarypisLab / TriangleCounting
  OpenMP-based parallel program for counting the number of triangles in a sparse graph
  ☆17Updated 6 years ago
• larsgottesbueren / gp-ann
  Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"
  ☆22Updated 4 months ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆204Updated 3 months ago
• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• lorenzhs / wrs
  Parallel Weighted Random Sampling
  ☆19Updated 4 years ago
• ByteHamster / PaCHash
  Packed and Compressed Hash Tables
  ☆15Updated last year
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆30Updated 11 months ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆87Updated 5 years ago
• KarypisLab / ParMETIS
  ParMETIS - Parallel Graph Partitioning and Fill-reducing Matrix Ordering
  ☆131Updated last year
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆24Updated last year
• UO-OACISS / apex
  Autonomic Performance Environment for eXascale (APEX)
  ☆44Updated last week
• GraphBLAS / rgri
  Reference implementation of the draft C++ GraphBLAS specification.
  ☆30Updated last month
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆114Updated last week
• LLNL / ygm
  ☆35Updated this week
• sympiler / sympiler
  Sympiler is a Code Generator for Transforming Sparse Matrix Codes
  ☆42Updated last year
• iHeartGraph / Enterprise
  Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.
  ☆31Updated 7 years ago