GREEDY IIP: partitioning large graphs by greedy iterative improvement

In various areas of computer science and mathematics, including scientific computing, task scheduling and VLSI design, the graph concept is used for modeling purposes, and graph partitioning algorithms are required to obtain solutions. For example, with increasing complexities of circuit design the circuit graphs may have several millions of nodes, while the CAD tools, like e.g. layout or visualization tools, work best on smaller subproblems. Thus, often partitions with a large number of components have to be determined. We present GREEDY IIP, a partitioning algorithm based on a sequence of greedy local operations. These operations are combined in an iterative manner directed by a restricted hill climbing approach. The algorithm is particularly successful, if a large number of final partitions, i.e. more than 1000, has to be computed. Experimental results on a large number of benchmarks are given. In comparison to the state-of-the-art tools GREEDY IIP shows significant advantages with respect to quality, space requirements and in many cases also with respect to run time