Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2001) A Fast Layout Algorithm for k-Level Graphs.
Published in: Graph drawing : 8th international symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20 - 23, 2000 ; proceedings, Lecture Notes in Computer Science. 1984 Springer 2001, pp. 86-89.

Abstract

In this paper, 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 (1981). The Sugiyama algorithm computes a layout for an arbitrary graph by (1) converting it into a k-level graph, (2) reducing the number of edge crossings by permuting the vertices on the levels, and (3) assigning y-coordinates to the levels and x-coordinates to the vertices. In the layouts generated by our algorithm, every edge will have at most two bends, and will be drawn vertically between these bends.

Actions:

Download:	Postscript - Preprinted Version Download (489Kb) | Preview
Export as:	HTML CitationASCII CitationOpenURL ContextObjectEndNoteBibTeXMPEG-21 DIDLEP3 XMLJSONAtomReference ManagerSimple MetadataRefer
Editorial actions:	View Item (Login required)