New spectral methods for ratio cut partitioning and clustering
- 1 January 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 11 (9), 1074-1085
- https://doi.org/10.1109/43.159993
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Ratio cut partitioning for hierarchical designsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1991
- A unified approach to partitioning and placement (VLSI layout)IEEE Transactions on Circuits and Systems, 1991
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990
- Partitioning logic on graph structures to minimize routing costIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
- Multiple-way network partitioningIEEE Transactions on Computers, 1989
- Graph bisection algorithms with good average case behaviorCombinatorica, 1987
- Optimization by Simulated AnnealingScience, 1983
- An Algorithm for Partitioning the Nodes of a GraphSIAM Journal on Algebraic Discrete Methods, 1982
- An r-Dimensional Quadratic Placement AlgorithmManagement Science, 1970
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970