1. Network Flow-based Bipartitioning
Perform flow-based bipartitioning under:
Area constraint [4,5]
Source = a, sink = i
Break ties alphabetically
Practical Problems in VLSI Physical Design

2. First Max-Flow and Its Cut
Practical Problems in VLSI Physical Design

3. First Node Merging
Practical Problems in VLSI Physical Design

4. Second Max-Flow and Its Cut
Practical Problems in VLSI Physical Design

5. Second Node Merging
Practical Problems in VLSI Physical Design

6. Third Max-Flow and Its Cut
Practical Problems in VLSI Physical Design