Drawing Directed Graphs Using One-Dimensional Optimization

Carmel, Liran and Harel, David and Koren, Yehuda (2002) Drawing Directed Graphs Using One-Dimensional Optimization. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 193-206(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_19).

Full text not available from this repository.

Abstract

We present an algorithm for drawing directed graphs, which is based on rapidly solving a unique one-dimensional optimization problem for each of the axes. The algorithm results in a clear description of the hierarchy structure of the graph. Nodes are not restricted to lie on fixed horizontal layers, resulting in layouts that convey the symmetries of the graph very naturally. The algorithm can be applied without change to cyclic or acyclic digraphs, and even to graphs containing both directed and undirected edges. We also derive a hierarchy index from the input digraph, which quantitatively measures its amount of hierarchy.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-36151-0_19
Classifications: M Methods > M.999 Others
M Methods > M.500 Layered
G Algorithms and Complexity > G.999 Others
URI: http://gdea.informatik.uni-koeln.de/id/eprint/300

Actions (login required)

View Item View Item