Partitioning Logic on Graph Structures to Minimize Routing Cost

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