机构:
Shandong Normal Univ, Sch Management Sci & Engn, Jinan 250014, Peoples R ChinaShandong Normal Univ, Sch Management Sci & Engn, Jinan 250014, Peoples R China
Qu, Jianhua
[1
]
Song, Yi
论文数: 0引用数: 0
h-index: 0
机构:
Shandong Normal Univ, Sch Management Sci & Engn, Jinan 250014, Peoples R ChinaShandong Normal Univ, Sch Management Sci & Engn, Jinan 250014, Peoples R China
Song, Yi
[1
]
Bressan, Stephane
论文数: 0引用数: 0
h-index: 0
机构:
Shandong Normal Univ, Sch Management Sci & Engn, Jinan 250014, Peoples R ChinaShandong Normal Univ, Sch Management Sci & Engn, Jinan 250014, Peoples R China
Bressan, Stephane
[1
]
机构:
[1] Shandong Normal Univ, Sch Management Sci & Engn, Jinan 250014, Peoples R China
来源:
2013 IEEE 29TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING WORKSHOPS (ICDEW)
|
2013年
关键词:
ALGORITHM;
D O I:
暂无
中图分类号:
TP301 [理论、方法];
学科分类号:
081202 ;
摘要:
Force-directed graph drawing algorithms compute a layout as the equilibrium of a physical system. This equilibrium is an optimum of the corresponding objective function. We propose a new method for drawing undirected graphs that uses particle swarm optimization (PSO). The graph is initialized with a swarm of random particles. The position vector of each particle corresponds to one layout of the graph. The objective function maps the layout into a real number representing the energy of the layout which is obtained by calculating the attractive and repulsive forces between the vertices. All particles automatically update their position and velocity to find the optimal layout until the algorithm terminates. PSO makes the implementation of the algorithm simple and easy. We empirically and comparatively evaluate the performance of the algorithm.
机构:
Institute of Theoretical Computer Science, Universität zu Lübeck, D-23562 Lübeck, GermanyInstitute of Theoretical Computer Science, Universität zu Lübeck, D-23562 Lübeck, Germany