基于主干子图的混合布局算法  

Hybrid layout algorithm based on skeleton subgraph

作　　者：张伟明[1] 张凯[1] 王清贤[1] 

机构地区：[1]信息工程大学信息工程学院,郑州450002

出　　处：《计算机应用》2008年第2期378-381,共4页journal of Computer Applications

基　　金：国家863计划项目(20031AA146010)

摘　　要：基于主干子图理论,提出了一种能够对幂率特征图进行布局的混合布局算法,其基本思想就是将待布局的原始图分解为主干子图和若干桩树,采用不同的布局算法对其进行分别布局。实验结果表明,当图的规模小于一定常数时,算法性能要优于传统的K-K算法,且在布局效果上,能使用户较容易地区分出图中的主干子图和各桩树。We presented a novel hybrid layout algorithm based on skeleton subgraph, which could handle the power-law graph. The key idea was to decompose the original graph into a skeleton subgraph and several stub trees, and to layout them with different graph drawing algorithms. The experiments and analysis indicate that our algorithm outperforms the traditional K- K algorithm when the size of the graph is smaller than a certain constant, and the result seems to be easier to lead the user to identify the skeleton subgraph and the stub trees, and to understand the original graph.

关 键 词：绘图 主干子图 幂率 布局 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]