• Area-efficient planar straight...

Result: Area-efficient planar straight-line drawings of outerplanar graphs

Title:
Area-efficient planar straight-line drawings of outerplanar graphs
Authors:
GARG, Ashim, RUSU, Adrian
Source:
Advances in graph drawing; The 11th International Symposium on Graph DrawingDiscrete applied mathematics. 155(9):1116-1140
Publisher Information:
Amsterdam; Lausanne; New York, NY: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 16 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Recherche information. Graphe, Information retrieval. Graph, Borne inférieure, Lower bound, Cota inferior, Combinatoire, Combinatorics, Combinatoria, Degré graphe, Graph degree, Grado grafo, Etirage, Drawing, Estiramiento, Graphe ligne, Line graph, Grafo línea, Graphe planaire, Planar graph, Grafo planario, Grille, Grid, Rejilla, Informatique théorique, Computer theory, Informática teórica, Maillage, Grid pattern, Celdarada, Optimisation, Optimization, Optimización, Superficie, Area, 68R10, Algorithme discret, Catégorie, Category, Plongement graphe, Area-efficient, Outerplanar, Planar, Straight-line
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science and Engineering, University at Buffalo, Buffalo, NY 14260, United States
Department of Computer Science, Rowan University, Glassboro, NJ 08028, United States
ISSN:
0166-218X
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=18788146
Rights:
Copyright 2008 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Mathematics
Accession Number:
edscal.18788146
Database:
PASCAL Archive

Further Information

It is important to minimize the area of a drawing of a graph, so that the drawing can fit in a small drawing-space. It is well-known that a planar graph with n vertices admits a planar straight-line grid drawing with O(n2) area [H. de Fraysseix, J. Pach, R. Pollack, How to draw a planar graph on a grid, Combinatorica 10(1) (1990) 41-51; W. Schnyder. Embedding planar graphs on the grid, in: Proceedings of the First ACM-SIAM Symposium on Discrete Algorithms, 1990, pp. 138-148]. Unfortunately, there is a matching lower-bound of Ω(n2) on the area-requirements of the planar straight-line grid drawings of certain planar graphs. Hence, it is important to investigate important categories of planar graphs to determine if they admit planar straight-line grid drawings with o(n2) area. In this paper, we investigate an important category of planar graphs, namely, outerplanar graphs. We show that an outerplanar graph G with degree d admits a planar straight-line grid drawing with area O(dn1.48 ) in O(n) time. This implies that if d= o(n0.52), then G can be drawn in this manner in o(n2) area.