k-Core based Multi-level Graph Visualization for Scale-free Networks

被引:0
|
作者
An Nguyen [1 ]
Hong, Seok-Hee [1 ]
机构
[1] Univ Sydney, Sch Informat Technol, Sydney, NSW, Australia
来源
2017 IEEE PACIFIC VISUALIZATION SYMPOSIUM (PACIFICVIS) | 2017年
基金
澳大利亚研究理事会;
关键词
I.3.3 [Computer Graphics]: Picture/Image Generation-Line and curve generation; ALGORITHM;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present a new multi-level graph drawing algorithm based on the k-core coarsening, a well-known cohesive subgroup analysis method in social network analysis. The k-core of a graph is also known as the degeneracy in graph theory, and can be computed in linear time. Our k-core based multi-level algorithm also includes a new concentric circle placement and a variation of force-directed layout to display the structure of graphs effectively. Experiments with real-world networks suggest that our algorithm performs well for visualization of large and complex scale-free networks, with a power-law degree distribution, a short diameter and a high clustering coefficient. Comparison with other multi-level algorithms shows that our method is fast and effective, in particular performs better than Walshaw [26] and FM3 [15].
引用
收藏
页码:21 / 25
页数:5
相关论文
empty
未找到相关数据