We propose a new graph layering heuristic which can be used for hierarchical graph drawing with the minimum width. Our heuristic takes into account the space occupied by both the nodes and the edges of a directed acyclic graph and constructs layerings which are narrower that layerings constructed by the known layering algorithms. It can be used as a part of the Sugiyama method for hierarchical graph drawing. We present an extensive parameter study which we performed for designing our heuristic as well as for comparing it to other layering algorithms. © Springer-Verlag 2004.
CITATION STYLE
Tarassov, A., Nikolov, N. S., & Branke, J. (2004). A heuristic for minimum-width graph layering with consideration of dummy nodes. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3059, 570–583. https://doi.org/10.1007/978-3-540-24838-5_42
Mendeley helps you to discover research relevant for your work.