Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Drawing Outer-Planar Graphs in O(n log n )Area

Therese BiedlContact Information

(6)  School of Computer Science, University of Waterloo, ON N2L 3G1 Waterloo, Canada
Abstract
In this paper,we study drawings of outer-planar graphs in various models.We showthat O (n log n )area can be achieved for such drawings if edges are allowed to have bends or if vertices may be represented by boxes.The question of straight-line grid-drawings of outer- planar graphs in o (n 2 )area remains open.
Research supported by NSERC.The author would like to thank Erik Demaine, Henk Meijer,Steve Wismath and the Algorithmic Problem Session Group at the University of Waterloo for inspiring discussions.

Contact Information Therese Biedl
Email: biedl@uwaterloo.ca
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Referenced by
1 newer article

  1. Battista, Giuseppe (2007) Small Area Drawings of Outerplanar Graphs. Algorithmica
    [CrossRef]
Remote Address: 38.107.191.109 • Server: mpweb08
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)