engleski

Kernighan-Lin algorithm for n-way circuit partitioning

The modified Kernighan-Lin algorithm implemented in programming language C is presented. Basic Kernighan-Lin solves a two-way partitioning problem, both equally sized and with equally sized vertices. It was extended in order to solve an n-way partitioning problem, each block arbitrarily sized and with vertices arbitrarily sized. The algorithm and its extensions are illustrated with few simple examples.

Kernighan-Lin algorithm; two-way partitioning

nije evidentirano