Spectral partitioning with multiple eigenvectors
Authors:
- Charles J AlpertCACharles J Alpert
- Andrew B KahngAKAndrew B Kahng
- So-Zen YaoSYSo-Zen Yao
- 1 January 1999
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 90 (1-3) , 3-26
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- Solving the max-cut problem using eigenvaluesDiscrete Applied Mathematics, 1995
- Recent directions in netlist partitioning: a surveyIntegration, 1995
- Multiway partitioning via geometric embeddings, orderings, and dynamic programmingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1995
- Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problemsConcurrency: Practice and Experience, 1994
- Modeling hypergraphs by graphs with the same mincut propertiesInformation Processing Letters, 1993
- An efficient eigenvector approach for finding netlist partitionsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- New spectral methods for ratio cut partitioning and clusteringIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- A unified approach to partitioning and placement (VLSI layout)IEEE Transactions on Circuits and Systems, 1991
- Combinatorial Algorithms for Integrated circuit Layout by T. Lengauer John Wiley and Sons, Chichester (UK), 1990, xxviii + 286 PP. (£35)Robotica, 1991