METIS - Serial Graph Partitioning and Fill-reducing Matrix Ordering

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

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.

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

METIS partitioner for mesh and graph

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

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

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

A Python library for anti-clustering algorithms

CMake enhanced Karypis METIS library

Coursework of NTHU CS613500 VLSI Physical Design Automation

Judicious Graph Partitioning

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

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

Coursework of NTHU CS516000 FPGA Architecture & CAD

Partitions an interval as evenly as possible.