A Fast Layout Algorithm for k-Level Graphs

Authors:
Christoph Buchheim;Michael Jünger;Sebastian Leipert
Affiliations:
-;-;-
Venue:
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Year:
2000

Citing 3
Cited 4

A Technique for Drawing Directed Graphs

IEEE Transactions on Software Engineering
A Fast Heuristic for Hierarchical Manhattan Layout

GD '95 Proceedings of the Symposium on Graph Drawing
A Library of Algorithms for Graph Drawing

GD '98 Proceedings of the 6th International Symposium on Graph Drawing

Graph Drawing Algorithm Engineering with AGD

Revised Lectures on Software Visualization, International Seminar
On the Parameterized Complexity of Layered Graph Drawing

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Crossing minimization and layouts of directed hypergraphs with port constraints

GD'10 Proceedings of the 18th international conference on Graph drawing
Upward planarization layout

GD'09 Proceedings of the 17th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

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.