19 search results - page 2 / 4 » Convex Drawings of 3-Connected Plane Graphs |
DAM
2008
13 years 5 months ago
2008
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...
JDA
2010
13 years 3 months ago
2010
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
IJFCS
2006
13 years 5 months ago
2006
IJFCS
2006
13 years 5 months ago
2006
GD
2006
Springer
13 years 9 months ago
2006
Springer
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continu...