DanielSeemaier

kahypar

KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisection based partitioning algorithms that compute solutions of very high quality.

mkexp

Scripts to install and run experiments with various distributed graph partitioners

graphtools

graphiobench

huge-allocs-test

FREIGHT

Streaming Hypergraph Partitioning

geographer

getaffinity

growt

This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating the current table once it gets too full.

HeiStream

Buffered Streaming Graph Partitioning

KaHIP

The graph partitioning framework KaHIP -- Karlsruhe High Quality Partitioning.

minloggapa

mt-kahypar

Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with parallel implementations of techniques used in the best sequential partitioning algorithms. Mt-KaHyPar can partition extremely large hypergraphs very fast and with high quality.

PuLP

sampling

Efficient Random Sampling: Parallel, Vectorized, Cache-Efficient, and Online

SparseAllToAllBenchmark

utils_tm

webgraph-converter

Convert graphs in the webgraph format to plain text edgelists.