We present a graph drawing algorithm that was developed as an extension of the hierarchical layout method of Sugiyama [4]. The main features of the algorithm are that the edges are orthogonal and that each edge has at most two bends. © Springer-Verlag Berlin Heidelberg 2002.
CITATION STYLE
Baburin, D. E. (2002). Some modifications of Sugiyama approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2528 LNCS, pp. 366–367). Springer Verlag. https://doi.org/10.1007/3-540-36151-0_36
Mendeley helps you to discover research relevant for your work.