Skip to main content
Conference ProceedingsOPEN ACCESS

A fast layout algorithm for k-level graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 1984 229-240
DOI: 10.1007/3-540-44541-2_22
19Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Buchheim, C., Jünger, M., & Leipert, S. (2001). A fast layout algorithm for k-level graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1984, pp. 229–240). Springer Verlag. https://doi.org/10.1007/3-540-44541-2_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free