최대컷값을 최소화하는 k-way 분할 연구

A Study on the K-way Partition Minimizing Maxcut

In this paper, we present a new k-way partitioning algorithm for a graph of an electrical circuit wherein nodes and edges are regarded as cells (modules) and nets, respectively. In contrast to the previous work, our method is based upon a linearly ordered partition paradigm. We also claim that the maximum number of netcuts mostly governs the performance of k-way partitioning, thus having influence on the construction of a new cost function. In addition, our approach elaborates upon balancing the partition size. Our experiments show excellent results in comparison with previous k-way partitioning algorithms.