partitioning-algorithms

METIS - Serial Graph Partitioning and Fill-reducing Matrix Ordering

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.

KaHIP -- Karlsruhe HIGH Quality Partitioning.

Header-Only C++ Library for Graph Representation and Algorithms

O'Reilly Book: [Data Algorithms with Spark] by Mahmoud Parsian

Big Data Modeling, MapReduce, Spark, PySpark @ Santa Clara University

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.

Generic graph (analysis) library in Typescript

implementation of partitioning mechanism on Apache Kafka and asynchronous communication between Vert.x microservices

Codes pertaining to OS Lab for Course CO254 - Operating Systems[CSE NITK SEM-4]

METIS partitioner for mesh and graph

A C++ implementation of the Quad-Tree spatial index.

CMake enhanced Karypis METIS library 5.1.0

Coursework of NTHU CS613500 VLSI Physical Design Automation

A Python library for anti-clustering algorithms

Single-master group membership framework with failure detection useful for stateless partitioning

Judicious Graph Partitioning

Generic worst-case-linear-time sorting and partitioning algorithms based on discriminators

Complex ray tracing algorithm optimized by using parallelization over different partitioning schemes and explore the performance gains through grain size and processing units (parameters) over sequential algorithm to render a high resolution image.

Simple graph partitioning for Rust.