Proceedings of the KIEE Conference (대한전기학회:학술대회논문집)
- 1988.07a
- /
- Pages.557-560
- /
- 1988
A Study on the K-way Partition Minimizing Maxcut
최대컷값을 최소화하는 k-way 분할 연구
- Kim, Kyung-Sik (ETRI) ;
- Lee, Chul-Dong (ETRI) ;
- Yu, Young-Uk (ETRI) ;
- Jhon, Chu-Shik (Seoul National Univ.) ;
- Hwang, Hee-Yung (Seoul National Univ.)
- Published : 1988.07.01
Abstract
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.
Keywords