Hybrid GA for Straight-Line Drawings of Level Clustered Planar Graphs

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 l evel 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. belonging to the same level on a horizontal line. The corresponding graphs are called level graphs, and the drawing of the networks that correspond to this category of graphs means the drawing of level graphs [17]. In fact, early articles in this area state that "the most crucial problem as far as readability of a graph is that of edge crossing " [7].