Abstract
We present a novel approach to the aesthetic drawing of undirected graphs. The method has two phases:first embed the graphinavery high dimension and then project it into the 2-D plane using principal components analysis. Running time is linear in the graph size, and experiments we have carried out show the ability of the method to draw graphs of 105 nodes in few seconds. The new method appears to have several advantages over classical methods, including a significantly better running time, a useful inherent capability to exhibit the graph in various dimensions, and an effective means for interactive exploration of large graphs. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
Harel, D., & Koren, Y. (2002). Graph drawing by high-dimensional embedding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2528 LNCS, pp. 207–219). Springer Verlag. https://doi.org/10.1007/3-540-36151-0_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
