On Spectral Graph Drawing
From MaRDI portal
Publication:3082957
DOI10.1007/3-540-45071-8_50zbMath1276.68161OpenAlexW1530948733MaRDI QIDQ3082957
Publication date: 18 March 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-45071-8_50
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (10)
Complex systems: features, similarity and connectivity ⋮ Decay bounds for Bernstein functions of Hermitian matrices with applications to the fractional graph Laplacian ⋮ Mesh segmentation by combining mesh saliency with spectral clustering ⋮ A spectral characterization of the Delaunay triangulation ⋮ Discrete trace theorems and energy minimizing spring embeddings of planar graphs ⋮ Equilateral Spherical Drawings of Planar Cayley Graphs ⋮ Enhanced graph-based dimensionality reduction with repulsion Laplaceans ⋮ A graph drawing algorithm for visualizing multivariate categorical data ⋮ Complex adjacency spectra of digraphs ⋮ Drawing graphs by eigenvectors: theory and practice
This page was built for publication: On Spectral Graph Drawing
