Keywords
ComputationEigenvalues and eigenvectorsVisualizationGraph drawingGraphTheoretical computer scienceMathematicsSpectral graph theoryAlgorithmComputer scienceMathematical optimizationData miningVoltage graphLine graph
Affiliated Institutions
Related Publications
On the Quality of Spectral Separators
Computing graph separators is an important step in many graph algorithms. A popular technique for finding separators involves spectral methods. However, there has not been much ...
Partitioning Sparse Matrices with Eigenvectors of Graphs
The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An ...
An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
Efficient use of a distributed memory parallel computer requires that the computational load be balanced across processors in a way that minimizes interprocessor communication. ...
Graph drawing by force‐directed placement
Abstract We present a modification of the spring‐embedder model of Eades [Congressus Numerantium, 42, 149–160, (1984)] for drawing undirected graphs with straight edges. Our heu...
A spectral algorithm for envelope reduction of sparse matrices
Abstract The problem of reordering a sparse symmetric matrix to reduce its envelope size is considered. A new spectral algorithm for computing an envelope‐reducing reordering is...
Publication Info
- Year
- 2005
- Type
- article
- Volume
- 49
- Issue
- 11-12
- Pages
- 1867-1888
- Citations
- 138
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
138
OpenAlex
Cite This
Yehuda Koren
(2005).
Drawing graphs by eigenvectors: theory and practice.
Computers & Mathematics with Applications
, 49
(11-12)
, 1867-1888.
https://doi.org/10.1016/j.camwa.2004.08.015
Identifiers
- DOI
- 10.1016/j.camwa.2004.08.015