Kernighan–Lin algorithm
From Wikipedia, the free encyclopedia
This article is about the heuristic algorithm for the graph partitioning problem. For the heuristic for the traveling salesperson problem, see Lin–Kernighan heuristic.
The Kernighan–Lin algorithm is a heuristic algorithm for finding partitions of graphs. The algorithm has important practical application in the layout of digital circuits and components in electronic design automation of VLSI.[1][2]