𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Convex drawings of hierarchical planar graphs and clustered planar graphs

✍ Scribed by Seok-Hee Hong; Hiroshi Nagamochi

Book ID
118475176
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
469 KB
Volume
8
Category
Article
ISSN
1570-8667

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Monotone drawings of planar graphs
Monotone drawings of planar graphs
✍ JΓ‘nos Pach; GΓ©za TΓ³th πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 92 KB

## Abstract Let __G__ be a graph drawn in the plane so that its edges are represented by __x__‐monotone curves, any pair of which cross an even number of times. We show that __G__ can be redrawn in such a way that the __x__‐coordinates of the vertices remain unchanged and the edges become non‐cross

Rectangular drawings of planar graphs
Rectangular drawings of planar graphs
✍ Md.Saidur Rahman; Takao Nishizeki; Shubhashis Ghosh πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 462 KB
Pointed drawings of planar graphs
Pointed drawings of planar graphs
✍ Oswin Aichholzer; GΓΌnter Rote; AndrΓ© Schulz; Birgit Vogtenhuber πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 321 KB
Towards area requirements for drawing hi
Towards area requirements for drawing hierarchically planar graphs
✍ Xuemin Lin; Peter Eades πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 240 KB

Hierarchical graphs are an important class of graphs for modeling many real applications in software and information visualization. In this paper, we investigate area requirements for drawing hierarchically planar graphs regarding two di erent drawing standards. Firstly, we show an exponential lower