A Fast Layout Algorithm for k-Level Graphs

Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2001) A Fast Layout Algorithm for k-Level Graphs. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000 , pp. 229-240(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_22).

This is the latest version of this item.

Full text not available from this repository.

Abstract

We present a fast layout algorithm for k-level graphs with given permutations of the vertices on each level. The algorithm can be used in particular as a third phase of the Sugiyama algorithm [8]. In the generated layouts, every edge has at most two bends and is drawn vertically between these bends. The total length of short edges is minimized levelwise.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-44541-2_22
Classifications: M Methods > M.500 Layered
G Algorithms and Complexity > G.999 Others
G Algorithms and Complexity > G.210 Bends
P Styles > P.480 Layered
URI: http://gdea.informatik.uni-koeln.de/id/eprint/365

Available Versions of this Item

Actions (login required)

View Item View Item