Prev Next

Circuit Partitioning Algorithms

The graphs are the comparisons of two types of circuit partitioning algorithms (used in splitting a circuit consisting of many devices up between two integrated circuits. The goal is to balance the sizes of the two partitions while minimizing the number of wires, cutset, between the two partitions).

Submitted by Rick Miller