An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)

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.

Judicious Graph 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.

Custom unembedding techniques for quantum annealers

[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

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

Assignment for Advanced Software Analysis, KNU (2021)

A coding project aimed at exploring new ways of algorithmic learning using evolutionary techniques such as genetic algorithms and crossover

Designing and implementing my own method to partition a graph into communities.