Kernighan-Lin algorithm

For a heuristic algorithm for the graph partitioning problem, see Kernighan-Lin algorithm.

Well known local methods are the Kernighan-Lin algorithm, and Fiduccia-Mattheyses algorithms, which were the first effective 2-way cuts by local search strategies.

(In a display of authorial equity, the former is usually called the Kernighan-Lin algorithm, while the latter is styled Lin-Kernighan.)