Multi-level spectral hypergraph partitioning with arbitrary vertex sizes

This paper presents a new spectral partitioning formulation which directly incorporates vertex size information. The new formulation results in a generalized eigenvalue problem, and this problem is reduced to the standard eigenvalue problem. Experimental results show that incorporating vertex sizes into the eigenvalue calculation produces results that are 50% better than the standard formulation in terms of scaled ratio-cut cost, even when a Kernighan-Lin style iterative improvement algorithm taking into account vertex sizes is applied as a post-processing step. To evaluate the new method for use in multi-level partitioning, we combine the partitioner with a multi-level bottom-up clustering algorithm and an iterative improvement algorithm for partition renement. Experimental results show that our new spectral algorithm is more eective than the standard spectral formulation and other partitioners in the multi-level partitioning of hypergraphs.

• Type: Conference
• Year: 1996
• Where: ICCAD
• Authors: Jason Y. Zien, Martine D. F. Schlag, Pak K. Chan
• Keywords: Hardware, ICCAD 1996, Iterative Improvement Algorithm, Spectral Partitioning Formulation, Vertex Sizes