1265 search results - page 6 / 253 » Algorithms for Drawing Media |
GD
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. Many graph drawing algorithms use st-numberings (st-orientations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a d...
GD
2003
Springer
14 years 17 days ago
2003
Springer
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same node set. We present three algorithms...
GD
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. In this paper we present an algorithm for 3-dimensional orthogonal graph drawing based on the movement of vertices from an initial layout along the main diagonal of a cub...
CONSTRAINTS
1998
13 years 7 months ago
1998
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...
ALGORITHMICA
2006
13 years 7 months ago
2006
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...