There are 26 repositories under graph-partitioning topic.
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.
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.
An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)
Papers on Graph Analytics, Mining, and Learning
A NetworkX implementation of Label Propagation from a "Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks" (Physical Review E 2008).
Implementation of Kernighan-Lin graph partitioning algorithm in Python
DRL models for graph partitioning and sparse matrix ordering.
Implements a generalized Louvain algorithm (C++ backend and Matlab interface)
A list of all publications related to the KaHyPar frameworks.
Parallel graph partitioning
The algorithms for multilevel evaluation of balance in signed directed networks
This is the source code of the algorithm described in the paper: "On Using Graph Partitioning with Isomorphism Constraint in Procedural Content Generation" presented at PCG Workshop 2017 part of FDG 2017.
CutESC: Cutting Edge Spatial Clustering Technique based on Proximity Graphs
A GPT-GNN based verilog netlist partitioner for 3D IC design
The algorithm based on the UBQP model (Aref et al. 2018) for computing the exact value of frustration index (also called line index of balance)
Implementation of the expander decomposition algorithm in https://arxiv.org/abs/1812.08958. Decompose graph with cluster expansion guarantee.
Judicious Graph Partitioning
Solve graph partitioning problem experimenting IP, CP (ortools) , Tabu search and GA
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.
Must-read papers on streaming graph
R package with quasi-Monte Carlo methods to estimate mixed models commonly used for random effect structures from pedigrees.
Source code for VLDB2024 - FSM: A Fine-grained Splitting and Merging Framework for Dual-balanced Graph Partition
A command-line tool for simple, single-step retrosynthetic reaction prediction using graph partitioning.
A Multiagent Algorithm for Graph Partitioning
Detecting controversial hashtags in twitter stream
Interpretive Structural Modelling (ISM). Returns a minimum-edge hierarchical digraph following J.N. Warfield's graph partitioning algorithm.
:mortar_board:📈 Metaheuristics to solve graph partition problem
[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