Block Exchange in Graph Partitioning

In a seminal paper (An ecient heuristic procedure for partitioning graphs,Bell System Technical Journal, 49 (1970), pp. 291-307), Kernighan and Linpropose a pair exchange algorithm for approximating the solution to min-cutgraph partitioning problems. In their algorithm, a vertex from one set in thecurrent partition is exchanged with a vertex in the other set to reduce the sumof the weights of cut edges. The exchanges continue until the total weight ofthe cut edges is no longer...