Spectral layout

Spectral layout is a class of algorithm for drawing graphs. The layout uses the eigenvectors of a matrix, such as the Laplace matrix of the graph, as Cartesian coordinates of the graph's vertices.

References

Beckman, Brian (1994), Theory of Spectral Graph Layout, Tech. Report MSR-TR-94-04, Microsoft Research .
Koren, Yehuda (2005), "Drawing graphs by eigenvectors: theory and practice" (PDF), Computers & Mathematics with Applications 49 (11–12): 1867–1888, doi:10.1016/j.camwa.2004.08.015, MR 2154691 .

This article is issued from Wikipedia - version of the Sunday, June 29, 2014. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.