@inproceedings{5f83cf5f5a454babb10b09c7dc29c550,
title = "A study on the relationship between initial node-edge pairs entropy and mincut circuit partitioning",
abstract = "In this paper, we find the relationship between mincut circuit partitioning and the initial (V, E) pairs distributed condition I entropy on the V-E plain. If a circuit has higher initial potential / entropy, under a nearly max-cut reservation, we have higher probability to aim the mincut. The proposed new method is called Interleaved Cutting - Edge-Node Interleaved Sort for Leaching and Envelop (IC-ENISLE) algorithm. It is not only using node and edge information, but also using max-min dual property. This new method is simple, but works effectively. Hundreds of netlists experiments have ever been processed. It shows we can soon get an intuitive heuristic nearly optimal solution for the mincut and the ratio mincut partitioning at the same time. And the method can display every process step by data compression techniques, is very suitable for IC CAD industrial usage.",
keywords = "Clustering effect, ENISLE, Max-cut, Min-cut partitioning, Ratio mincut partitioning, VLSI circuit",
author = "Cheng, {Kuo Hsing} and Cheng, {Shun Wen}",
year = "2001",
language = "???core.languages.en_GB???",
isbn = "0780370570",
series = "Proceedings of the IEEE International Conference on Electronics, Circuits, and Systems",
pages = "889--893",
booktitle = "ICECS 2001 - 8th IEEE International Conference on Electronics, Circuits and Systems",
note = "8th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2001 ; Conference date: 02-09-2001 Through 05-09-2001",
}