Multi-level spectral hypergraph partitioning with arbitrary vertex sizes (1996) [9 citations — 1 self]
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Zien96multi-levelspectral,author = {Jason Y. Zien and Martine D. F. Schlag and Pak K. Chan},
title = {Multi-level spectral hypergraph partitioning with arbitrary vertex sizes},
booktitle = {Proc. ICCAD},
year = {1996},
pages = {201--204},
publisher = {IEEE Press}
}
Years of Citing Articles
Abstract:
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 refinement. Experimental results show that our new spectral algorithm is more effective than the standard spectral formulation and other partitioners in the multi-level partitioning of hypergraphs of unit-sized vertices.
Citations
| 253 | A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems – Barnard, Simon - 1993 |
| 8 | Multiway Partitioning Via Geometric Embeddings, Orderings, and Dynamic Programming – Alpert, Kahng - 1995 |
| 1 | Theory with Applications to Algorithms and Computer Science – Chan, Schlag, et al. - 1985 |
