ENISLE: an intuitive heuristic nearly optimal solution for mincut and ratio mincut partitioning

[[abstract]]Mincut partitioning is to minimize the total cuts of the edges by the partitioning of nodes into two sets. The proposed method, Edge-Node Interleaved Sort for Leaching and Envelop (ENISLE) algorithm, not only uses node information but also uses edge information. It is simple, but works effectively, and has never appeared in any earlier literature. It can soon obtain an intuitive heuristic nearly optimal solution for mincut and ratio mincut partitioning and, at the same time, is very suitable for EDA usage.[[conferencetype]]國際[[conferencedate]]20010506~20010509[[booktype]]紙本[[iscallforpapers]]Y[[conferencelocation]]Syndey, NSW, Australi