An efficient eigenvector approach for finding netlist partitions
- 1 July 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 (7), 885-892
- https://doi.org/10.1109/43.144852
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990
- A parallel graph partitioning algorithm for a message-passing multiprocessorInternational Journal of Parallel Programming, 1987
- Near-optimal placement using a quadratic objective functionPublished by Association for Computing Machinery (ACM) ,1985
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Logic Minimization Algorithms for VLSI SynthesisPublished by Springer Science and Business Media LLC ,1984
- A Linear-Time Heuristic for Improving Network PartitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- The minimization of certain nondifferentiable sums of eigenvalues of symmetric matricesPublished by Springer Science and Business Media LLC ,1975
- A Heuristic Procedure for the Partitioning and Mapping of Computer Logic GraphsIEEE Transactions on Computers, 1971
- An r-Dimensional Quadratic Placement AlgorithmManagement Science, 1970
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970