论文信息 - A Fast Layout Algorithm for k-Level Graphs

A Fast Layout Algorithm for k-Level Graphs

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.

Michael Jünger | Christoph Buchheim | Sebastian Leipert

[1] Michael Jünger,et al. Algorithmen zum automatischen Zeichnen von Graphen , 1997, Informatik-Spektrum.

[2] Petra Mutzel,et al. AGD - A Library of Algorithms for Graph Drawing , 1998, Graph Drawing Software.

[3] Mitsuhiko Toda,et al. Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[4] Emden R. Gansner,et al. A Technique for Drawing Directed Graphs , 1993, IEEE Trans. Software Eng..

[5] Georg Sander,et al. A Fast Heuristic for Hierarchical Manhattan Layout , 1995, GD.

[6] Michael Jünger,et al. Journal of Graph Algorithms and Applications 2-layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms , 2022 .

[7] David S. Johnson,et al. Crossing Number is NP-Complete , 1983 .

[8] Ioannis G. Tollis,et al. Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..