On spectral graph drawing

DOI10.1007/3-540-45071-8_50MaRDI QIDQ3082957zbMATH OpenOpenAlexFDO

Authors Yehuda Koren

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

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Drawing graphs by eigenvectors: theory and practice
• Graph Drawing
• Dynamic Spectral Layout with an Application to Small Worlds
• Graph Drawing
• SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding

Cited in

(27)

• Mesh segmentation by combining mesh saliency with spectral clustering
• Aesthetic discrimination of graph layouts
• Data visualization through graph drawing
• Decay bounds for Bernstein functions of Hermitian matrices with applications to the fractional graph Laplacian
• Discrete trace theorems and energy minimizing spring embeddings of planar graphs
• Enhanced graph-based dimensionality reduction with repulsion Laplaceans
• Magnetic eigenmaps for the visualization of directed networks
• scientific article; zbMATH DE number 2084284 (Why is no real title available?)
• Graph Drawing by High-Dimensional Embedding
• Efficient calculation of aestheticy metrics of a graph
• SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
• A graph drawing algorithm for visualizing multivariate categorical data
• Drawing Big Graphs Using Spectral Sparsification
• Graph drawing by classical multidimensional scaling: new perspectives
• Complex adjacency spectra of digraphs
• Equilateral spherical drawings of planar Cayley graphs
• Eigenvector visualization and art
• Dynamic Spectral Layout with an Application to Small Worlds
• scientific article; zbMATH DE number 2188497 (Why is no real title available?)
• Graph Drawing
• Spectral Sequencing Based on Graph Distance
• Graph Drawing
• Graph Drawing
• A spectral characterization of the Delaunay triangulation
• A flexible PageRank-based graph embedding framework closely related to spectral eigenvector embeddings
• Drawing graphs by eigenvectors: theory and practice
• Complex systems: features, similarity and connectivity

This page was built for publication: On spectral graph drawing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3082957)