Abstract
In this chapter, we present the standard criterea and techniques for drawing directed graphs1. The resulting drawings are called layered drawings of the given graphs.
Supported by the Deutsche Forschungsgemeinschaft (DFG), graduate program Angewandte Algorithmische Mathematik, Technische Universität München.
Supported by the Deutsche Forschungsgemeinschaft (DFG), grant Mo645/5, Martin-Luther-Universität Halle-Wittenberg
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bastert, O., Matuszewski, C. (2001). Layered Drawings of Digraphs. In: Kaufmann, M., Wagner, D. (eds) Drawing Graphs. Lecture Notes in Computer Science, vol 2025. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44969-8_5
Download citation
DOI: https://doi.org/10.1007/3-540-44969-8_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42062-0
Online ISBN: 978-3-540-44969-0
eBook Packages: Springer Book Archive