SDE: Graph Drawing Using Spectral Distance Embedding
We present a novel graph drawing algorithm which uses a spectral decomposition of the distance matrix to approximate the graph theoretical distances. The algorithm preserves symmetry and node densities, i.e., the drawings are aesthetically pleasing. The runtime for typical 20,000 node graphs ranges from 100 to 150 seconds.
- 1.Civril, A., Magdon-Ismail, M., Rivele, E.B.: SDE: Graph drawing using spectral distance embedding. Technical report, Rensselaer Polytechnic Institute (2005)Google Scholar