DocumentCode
2496711
Title
PSOGD: A new method for graph drawing
Author
Jianhua Qu ; Yi Song ; Bressan, S.
Author_Institution
Sch. of Manage. Sci. & Eng., Shandong Normal Univ., Jinan, China
fYear
2013
fDate
8-12 April 2013
Firstpage
229
Lastpage
235
Abstract
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.
Keywords
graph theory; particle swarm optimisation; vectors; PSOGD; force-directed graph drawing algorithm; objective function; particle swarm optimization; performance evaluation; physical system; position vector; undirected graph; Algorithm design and analysis; Encoding; Force; Layout; Linear programming; Particle swarm optimization; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Engineering Workshops (ICDEW), 2013 IEEE 29th International Conference on
Conference_Location
Brisbane, QLD
Print_ISBN
978-1-4673-5303-8
Electronic_ISBN
978-1-4673-5302-1
Type
conf
DOI
10.1109/ICDEW.2013.6547455
Filename
6547455
Link To Document