Buchheim, Christoph 
ORCID: 0000-0001-9974-404X, Jünger, Michael and Leipert, Sebastian
(2001).
A Fast Layout Algorithm for k-Level Graphs.
Springer.
|
PDF
zaik1999-368.pdf Download (343kB) | Preview |
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.
| Item Type: | Other | ||||||||||||||||
| Creators: |
|
||||||||||||||||
| URN: | urn:nbn:de:hbz:38-548488 | ||||||||||||||||
| Series Name: | Lecture Notes in Computer Science | ||||||||||||||||
| Volume: | 1984 | ||||||||||||||||
| Page Range: | pp. 86-89 | ||||||||||||||||
| Date: | 2001 | ||||||||||||||||
| Publisher: | Springer | ||||||||||||||||
| Language: | English | ||||||||||||||||
| Faculty: | Faculty of Mathematics and Natural Sciences | ||||||||||||||||
| Divisions: | Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science | ||||||||||||||||
| Subjects: | Data processing Computer science | ||||||||||||||||
| URI: | http://kups.ub.uni-koeln.de/id/eprint/54848 |
Downloads
Downloads per month over past year
Export
Actions (login required)
 |
View Item |