Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2012.031216
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 3 Issue 12, 2012.
Abstract: Hierarchical planar graph embedding (sometimes called level planar graphs) is widely recognized as a very important task in diverse fields of research and development. Given a proper hierarchical planar graph, we want to find a geometric position of every vertex (layout) in a straight-line grid drawing without any edge-intersection. An additional objective is to minimize the area of the rectangular grid in which G is drawn with more aesthetic embedding. In this paper we propose several ideas to find an embedding of G in a rectangular grid with area, ( -1) × (k-1), where is the number of vertices in the longest level and k is the number of levels in G.)
Mohamed A. El Sayed, Ahmed A. A. Radwan and Nahla F. Omran , “Study of Proper Hierarchical Graphs on a Grid” International Journal of Advanced Computer Science and Applications(IJACSA), 3(12), 2012. http://dx.doi.org/10.14569/IJACSA.2012.031216