计算机与现代化Issue(8)：107-111,5.DOI:10.3969/j.issn.1006-2475.2015.08.022
基于图匹配的分层布局算法
A Hierarchical Layout Algorithm Based on Graph Matching
赵玉聪 1钟志农 1吴烨 1景宁1
作者信息
- 1. 国防科学技术大学电子科学与工程学院，湖南 长沙 410073
- 折叠
摘要
Abstract
In order to draw the undirected graph with big and even degrees, we propose a hierarchical layout algorithm based on graph matching ( GMH) .Firstly, a series of coarser and coarser graphs are generated by graph matching.Secondly, the optimal FR layout for the coarsest graph can be found cheaply.In the end, the layout on the coarser graphs is recursively prolonged to the finer graphs by the mass-center method.The new algorithm can not only advance the efficiency of graph visualization and improve the effect of layout, but also show a series of hierarchical graphs.关键词
可视化/无向图/图匹配/质心扩展/分层布局Key words
visualization/undirected graph/graph matching/mass-center prolong/hierarchical layout分类
信息技术与安全科学引用本文复制引用
赵玉聪,钟志农,吴烨,景宁..基于图匹配的分层布局算法[J].计算机与现代化,2015,(8):107-111,5.
