Charles J. Alpert, So-Zen Yao  Home/Search
Context Related
| ucla.edu/techreport/1994...940036.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucla.edu/csd/pubs/allreports (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A spectral partitioning heuristic is one that uses eigenvectors of a graph's adjacency or Laplacian matrix for constructing a solution. Previous heuristics have used eigenvectors to construct useful geometric representations of the graph, e.g., 1-dimensional placements. Our new representation maps each graph vertex to a vector in d-dimensional space, where d is the number of eigenvectors; these vectors constitute an instance of the vector partitioning problem. We show that when all the... (Update)
Similar documents based on text: More All
1.4: Spectral Partitioning: The More Eigenvectors, The Better - Charles Alpert (1994) (Correct)
0.4: Twoway Partitioning Based on Direction Vector - Seong And Kyung (1997) (Correct)
0.4: Simple Eigenvector-Based Circuit Clustering Can Be Effective - Alpert, Kahng (Correct)
BibTeX entry: (Update)
C. J. Alpert and S.-Z. Yao, "Spectral Partitioning: The More Eigenvectors, the Better," UCLA CS Dept. Technical Report, #940036, October 1994. http://citeseer.ist.psu.edu/alpert94spectral.html More
@misc{ alpert94spectral,
author = "C. Alpert and S. Yao",
title = "Spectral Partitioning: The More Eigenvectors, the Better",
text = "C. J. Alpert and S.-Z. Yao, Spectral Partitioning: The More Eigenvectors,
the Better, UCLA CS Dept. Technical Report, #940036, October 1994.",
year = "1994",
url = "citeseer.ist.psu.edu/alpert94spectral.html" }
Citations (may not include all citations):77 Multiple-way Network Partitioning (context) - Sanchis - 1989
73 New Spectral Methods for Ratio Cut Partitioning and Clusteri.. (context) - Hagen, Kahng - 1992
70 The Laplacian Spectrum of Graphs (context) - Mohar - 1988
57 An Algorithm for Partitioning the Nodes of a Graph (context) - Barnes - 1992
39 A New Approach to Effective Circuit Clustering - Hagen, Kahng - 1992
34 An r-dimensional Quadratic Placement Algorithm (context) - Hall - 1970
33 Finding Clusters in VLSI Circuits (context) - Garbers, Promel et al. - 1990
30 Spectral K-Way Ratio Cut Partitioning and Clustering (context) - Chan, Schlag et al.
27 Geometric Embeddings for Faster and Better Multi-Way Netlist.. - Alpert, Kahng - 1993
24 A General Framework for Vertex Orderings, With Applications .. - Alpert, Kahng - 1994
15 Circuit Placements and Cost Bounds by Eigenvector Decomposit.. (context) - Frankle, Karp
14 An Efficient Eigenvector Approach for Finding Netlist Partit.. (context) - Hadley, Mark et al. - 1992
14 Multi-way Partitioning Via Spacefilling Curves and Dynamic P.. - Alpert, Kahng - 1994
13 A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut.. (context) - Bui, Moon - 1994
6 Partitioning Very Large Circuits Using Analytical Placement .. (context) - Riess, Doll et al. - 1994
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.ucla.edu/csd/pubs/all-reports.html): More
Applications of the Matroid Parity Problem to.. - Berman, Fürer.. (1998) (Correct)
Efficient Gate Delay Modeling for Large Interconnect Loads - Andrew Kahng (1996) (Correct)
System-level Synthesis of Hard Real-Time Application.. - Lee, Potkonjak, Wolf (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC