An Improved Min-Cut Algonthm for Partitioning VLSI Networks

This-paper generalizes the ideas of Fiduccia and Mattheyses and suggests a class of increasingly sophisticated heuristics, and shows that the computational complexity of any specific heuristic in the suggested class remains linear in the size of the network.

Abstract

Recently, a fast (linear) heuristic for improving min-cut partitions of VLSI networks was suggested by Fiduccia and Mattheyses [6]. In this-paper we generalize their ideas and suggest a class of increasingly sophisticated heuristics. We then show, by exploiting the data structures originally suggested by them, that the computational complexity of any specific heuristic in the suggested class remains linear in the size of the network.