Fast and Near-Optimal Timing-Driven Cell Sizing under Cell Area and Leakage Power Constraints Using a Simplified Discrete Network Flow Algorithm

Figure 8

The flow path for determining the path cost of 𝑆¹_𝑢, and the arcs for determining the arc cost of 𝑆¹_𝑢.