Can I read Kernighan-Lin Algorithm for Partitioning on EtoBox?
Kernighan-Lin Algorithm for Partitioning by suburaaj is a document available to read on EtoBox.
What is Kernighan-Lin Algorithm for Partitioning about?
The Kernighan-Lin algorithm is an iterative improvement algorithm for partitioning graphs into two parts of equal size to minimize the cut cost. It starts with an initial partition and then attempts to improve it by swapping nodes between the two parts. It computes the gain of all possible swaps and selects the swap with the highest gain, locks it in, and updates the node costs and benefits. It repeats this process of selecting the best swap until no further improvements can be made.
- Author
- suburaaj
- Language
- EN