期刊名称：International Journal of Computer Science Issues
印刷版ISSN：1694-0784
电子版ISSN：1694-0814
出版年度：2011
卷号：8
期号：4
出版社：IJCSI Press
摘要：In this paper we introduce an application of genetic algorithms (GAs) with the problem of drawing of level planar graph or hierarchical planar graph, and explore the potential use of GAs to solve this particular problem. Given a level planar graph, we want to find a geometric position of every vertex (layout) in a straight-line grid drawing without any edge-intersection. Here we introduce a simple hybrid GA, which nicely draws level planar graph of moderate size. The paper shows that the GAs can help find an layout of levels and hierarchical planar graphs without any crossing edges.
