431 search results - page 19 / 87 » Bold Graph Drawings |
GD
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. One of the most popular graph drawing methods is based on achieving graph-theoretic target distances. This method was used by Kamada and Kawai [15], who formulated it as ...
DIAGRAMS
2004
Springer
15 years 4 months ago
2004
Springer
We describe a method for drawing graph-enhanced Euler diagrams using a three stage method. The first stage is to lay out the underlying Euler diagram using a multicriteria optimizi...
101
click to vote
COMPGEOM
1996
ACM
15 years 3 months ago
1996
ACM
We provideO(n)-timealgorithmsfor constructingthe following types of drawings of n-vertex 3-connectedplanar graphs: 2D convex grid drawings with (3n) (3n=2) area under the edge L1-...
GD
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our ...
GD
1998
Springer
15 years 3 months ago
1998
Springer
This report proposes a