Partitioning by iterative deletion

Netlist partitioning is an important and well studied problem. In this paper, a linear time partitioning approach based on iterative deletion is presented. We use the partitioning problem to allow a fair comparison of the iterative deletion approach with well known iterative improvement methods. For partitioning problems with a range of edge weights, and for multi-way partitioning, the iterative deletion approach can outperform the iterative improvement method. The algorithmic approach is flexible and can support complex cost functions directly.

• Type: Conference
• Year: 1999
• Where: ISPD
• Authors: Patrick H. Madden
• Keywords: Hardware, ISPD 1999, Iterative Deletion, Iterative Deletion Approach, Iterative Improvement Method