A study on the relationship between initial node-edge pairs entropy and mincut circuit partitioning

In this paper, we find the relationship between mincut circuit partitioning and the initial (V, E) pairs distributed condition/entropy on the V-E plain. If a circuit has higher initial potential/entropy, under a nearly max-cut reservation, we have a 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 not only uses node and edge information, but also uses the max-min dual property. This new method is simple, but works effectively. Hundreds of netlist experiments have ever been processed. It shows that we can soon get an intuitive heuristic nearly optimal solution for the mincut and the ratio mincut partitioning at the same time. Also the method can display every process step by data compression techniques, is very suitable for IC CAD industrial usage