Abstract
This paper proposes an improved genetic algorithm for producing aesthetically pleasing drawings of general undirected graphs. Previous undirected graph drawing algorithms draw large cycles with no chords as concave polygons. In order to overcome such disadvantage, the genetic algorithm in this paper designs a new mutation operator single-vertex- neighborhood mutation and adds a component aiming at symmetric drawings to the fitness function, and it can draw such type graphs as convex polygons. The improved algorithm is of following advantages: The method is simple and it is easy to be implemented, and the drawings produced by the algorithm are beautiful, and also it is flexible in that the relative weights of the criteria can be altered. The experiment results show that the drawings of graphs produced by our algorithm are more beautiful than those produced by simple genetic algorithms, the original spring algorithm and the algorithm in bibliography [4].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Tamassia, R., Di Battista, G., Batini, C.: Automatic graph drawing and readability of diagrams. IEEE Transactions on Systems, Man and Cybernetics 18(1), 61–79 (1988)
Eades, P.: A Heuristic for Graph Drawing. Congressus Numerantium 42, 149–160 (1984)
Davidson, R., Harel, D.: Drawing Graphs Nicely Using Simulated Annealing. ACM Transactions on Graphics 15(4), 301–331 (1996)
Eloranta, T., Mäkinen, E.: TimGA - a genetic algorithm for drawing undirected graphs. Technical report, Department of Computer Science, University of Tampere (December 1996)
Tanese, R.: Distributed Genetic Algorithms for Function Optimization. Unpublished doctoral dissertation, University of Michigan, Ann Arbor, MI (1989)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, Heidelberg (1996)
Masui, T.: Evolutionary learning of graph layout constraints from examples. In: Proceedings of the ACM Symposium on User Interface Software and Technology (UIST 1994), pp. 103–108. ACM Press, New York (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, QG., Liu, HY., Zhang, W., Guo, YJ. (2005). Drawing Undirected Graphs with Genetic Algorithms. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_4
Download citation
DOI: https://doi.org/10.1007/11539902_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28320-1
Online ISBN: 978-3-540-31863-7
eBook Packages: Computer ScienceComputer Science (R0)