Source code for VLDB2024 - FSM: A Fine-grained Splitting and Merging Framework for Dual-balanced Graph Partition

Assignments done as part of UG Lab course

🎓📈 Metaheuristics to solve graph partition problem

Implementation of the expander decomposition algorithm in https://arxiv.org/abs/1812.08958. Decompose graph with cluster expansion guarantee.

A Heterogeneity-Aware Graph Partitioning Algorithm in Distributed Environment

Parallel graph partitioning

Implements a generalized Louvain algorithm (C++ backend and Matlab interface)

A graph partitioning algorithm for spatial network for parallel and distributed computing

A command-line tool for simple, single-step retrosynthetic reaction prediction using graph partitioning.

Graph edge partitioning algorithms

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.

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.