Kernighan-Lin algorithm

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Etymology[edit]

Devised by Shen Lin and Brian Kernighan.

Proper noun[edit]

the Kernighan-Lin algorithm

  1. (computing theory) A heuristic algorithm for finding partitions of graphs, having important applications in the layout of digital circuits and components in VLSI.