About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Partitioning Logic on Graph Structures to Minimize Routing Cost
Abstract
We address the problem of partitioning logic on to the vertices of a partition graph G such that the cost of routing the global nets of the partition on the edges of G is minimized. We refer to this as the min-cost partitioning on a graph (MCPG) problem. The MCPG problem generalizes previously studied partitioning problems, such as classical min-cut, the quadrisection approach, min-cost tree partitioning, and multiple way network partitioning. We discuss some applications of this partitioning model, describe a framework for its solution, and discuss experimental results. © 1990 IEEE