Julia wrapper for the SCOTCH library

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.

Demonstration to solve the Graph Partitioning problem

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.

Reconstruction of the map of Avignon during medieval times

KaHIP -- Karlsruhe HIGH Quality Partitioning.

The Kernighan–Lin algorithm is a heuristic algorithm for finding partitions of graphs. The algorithm has important applications in the layout of digital circuits and components in VLSI.

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

A modern Fortran interface to the METIS graph partitioning library

DRL models for graph partitioning and sparse matrix ordering.

[TKDD'23] Demo code of the paper entitled "Towards a Better Trade-Off between Quality and Efficiency of Community Detection: An Inductive Embedding Method across Graphs", which has been accepted by ACM TKDD

Graph Challenge

USENIX Security'23: Inductive Graph Unlearning

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

Kernighan-Lin Algorithm implementation in python. Kernighan-Lin Algorithm is a graph partitioning algorithm that optimizes the cut size between two subsets of nodes.

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

R package with quasi-Monte Carlo methods to estimate mixed models commonly used for random effect structures from pedigrees.

Custom unembedding techniques for quantum annealers

A GPT-GNN based verilog netlist partitioner for 3D IC design

A NetworkX implementation of Label Propagation from a "Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks" (Physical Review E 2008).