Spectral Graph Drawing: Building Blocks and Performance Analysis
Shad Kirmani, Kamesh Madduri · 2018
The objective of a graph drawing algorithm is to automatically produce an aesthetically-pleasing two or three dimensional visualization of a graph. Spectral graph theory refers to the study of eigenvectors of matrices derived from graphs. There are several well-known graph drawing algorithms that use insights from spectral graph theory. In this work, we experiment with two spectral methods to generate drawings of large-scale graphs. We also combine spectral drawings with the multilevel approach, and this leads to a larger collection of implementations. We analyze drawing quality and performance tradeoffs with these approaches.