140 search results - page 4 / 28 » On simultaneous planar graph embeddings |
SIGAL
1990
13 years 10 months ago
1990
In this paper we show that every 2-connected embedded planar graph with faces of sizes
GD
1999
Springer
13 years 10 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 ...
JGT
2007
13 years 6 months ago
2007
: Let G be a 3-connected planar graph and G∗ be its dual. We show that the pathwidth of G∗ is at most 6 times the pathwidth of G. We prove this result by relating the pathwidth...
COCOON
1999
Springer
13 years 10 months ago
1999
Springer
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
ESA
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...