91 search results - page 5 / 19 » Two-Layer Planarization in Graph Drawing |
JDA
2006
13 years 7 months ago
2006
Abstract. Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e. hierarchically clustered graphs that have the p...
DAM
2008
13 years 7 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 ...
GD
1999
Springer
13 years 11 months ago
1999
Springer
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
COMGEO
2004
ACM
13 years 7 months ago
2004
ACM
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach all...