Kernighan–Lin_algorithm
's information is

Birth and death years unknown

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.

* Calculated from Wikipedia data.
Accuracy is not guaranteed.

Look up "Kernighan–Lin_algorithm" on Wikipedia

Comments About "Kernighan–Lin_algorithm"

Loading...