Drawing graphs by eigenvectors: Theory and practice
Drawing graphs by eigenvectors: Theory and practice
复制标题
DOI：
10.1016/j.camwa.2004.08.015
复制
发表时间：
2005-06-01
影响因子：
2.9
通讯作者：
Koren, Y
中科院分区：
文献类型：
--
作者：
Koren, Y
图可视化的谱方法使用相关矩阵的某些特征向量来计算图的布局。这种方法的两个重要优点是能够计算最佳布局（根据特定要求）和非常快速的计算时间。在本文中，我们探索光谱可视化技术，并从不同的角度研究其性质。我们还提出了一种新的算法，用于计算频谱布局，从而在一个非常快速的计算优化布局在一个小的向量空间。(c)2005爱思唯尔有限公司保留所有权利。
The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Two important advantages of this approach are an ability to compute optimal layouts (according to specific requirements) and a very rapid computation time. In this paper, we explore spectral visualization techniques and study their properties from different points of view. We also suggest a novel algorithm for calculating spectral layouts resulting in an extremely fast computation by optimizing the layout within a small vector space. (c) 2005 Elsevier Ltd. All rights reserved.