Spectral partitioning
Charles J. Alpert, So-Zen Yao · Proceedings - ACM IEEE Design Automation Conference · 1995
Article Free Access Share on Spectral partitioning: the more eigenvectors, the better Authors: Charles J. Alpert UCLA Computer Science Department, Los Angeles, CA UCLA Computer Science Department, Los Angeles, CAView Profile , So-Zen Yao Cadence Design Systems, San Jose, CA Cadence Design Systems, San Jose, CAView Profile Authors Info & Claims DAC '95: Proceedings of the 32nd annual ACM/IEEE Design Automation ConferenceJanuary 1995 Pages 195–200https://doi.org/10.1145/217474.217529Online:01 January 1995Publication History 84citation1,151DownloadsMetricsTotal Citations84Total Downloads1,151Last 12 Months50Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Cited by 202 works. doi:10.1145/217474.217529
Authors
References
- THE LAPLACIAN SPECTRUM OF GRAPHS y
- New spectral methods for ratio cut partitioning and clustering
- An r-Dimensional Quadratic Placement Algorithm
- An Algorithm for Partitioning the Nodes of a Graph
- Recent directions in netlist partitioning: a survey
- Spectral K-way ratio-cut partitioning and clustering
- The Laplacian spectrum of graphs
- Finding clusters in VLSI circuits
- A new approach to effective circuit clustering
- A new approach to effective circuit clustering