graph-partitioning
Here are 67 public repositories matching this topic...
Language:All
Sort:Most stars
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.
- Updated
Oct 25, 2025 - C++
KaHIP -- Karlsruhe HIGH Quality Partitioning.
- Updated
Nov 4, 2025 - C++
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.
- Updated
Nov 28, 2025 - C++
An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)
- Updated
Nov 6, 2022 - Python
Papers on Graph Analytics, Mining, and Learning
- Updated
Aug 15, 2022
A NetworkX implementation of Label Propagation from a "Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks" (Physical Review E 2008).
- Updated
Nov 6, 2022 - Python
Implementation of Kernighan-Lin graph partitioning algorithm in Python
- Updated
May 19, 2019 - Python
Graph edge partitioning algorithms
- Updated
Oct 17, 2019 - C++
A modern Fortran interface to the METIS graph partitioning library
- Updated
Aug 5, 2024 - Fortran
DRL models for graph partitioning and sparse matrix ordering.
- Updated
Nov 5, 2023 - Python
Implements a generalized Louvain algorithm (C++ backend and Matlab interface)
- Updated
Sep 17, 2019 - C++
A list of all publications related to the KaHyPar frameworks.
- Updated
Apr 23, 2022
Parallel graph partitioning
- Updated
Nov 11, 2017 - C++
A random graph partitioning algorithm inspired from label propagation method
- Updated
Jul 19, 2020 - Jupyter Notebook
The algorithms for multilevel evaluation of balance in signed directed networks
- Updated
Jul 4, 2024 - Jupyter Notebook
A GPT-GNN based verilog netlist partitioner for 3D IC design
- Updated
Jul 9, 2025 - Verilog
Must-read papers on streaming graph
- Updated
Aug 19, 2025
Implementation of the expander decomposition algorithm inhttps://arxiv.org/abs/1812.08958. Decompose graph with cluster expansion guarantee.
- Updated
Jun 6, 2023 - C++
USENIX Security'23: Inductive Graph Unlearning
- Updated
Aug 11, 2024 - Jupyter Notebook
CutESC: Cutting Edge Spatial Clustering Technique based on Proximity Graphs
- Updated
Nov 15, 2019 - Jupyter Notebook
Improve this page
Add a description, image, and links to thegraph-partitioning topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with thegraph-partitioning topic, visit your repo's landing page and select "manage topics."