Abstract
In many applications of graph drawing which have been described in Chapter 1 one faces graph classes with a special structure. First of all, this means that specific layout criteria become possible. Second, the structural properties of these classes allow the development of more powerful algorithms with respect to running time and layout space requirements. Among the many special graph classes which exist, probably most attention has been paid to trees and planar graphs. Algorithms and methods for planar graphs in general have been given in Chapter 2. This chapter concentrates on three different graph classes, namely on trees and series-parallel digraphs (which are, of course, even more specialized planar graphs), but also on graphs arising from lattices, more precisely, on covering digraphs of lattices.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
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
Müller-Hannemann, M. (2001). Drawing Trees, Series-Parallel Digraphs, and Lattices. 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_3
Download citation
DOI: https://doi.org/10.1007/3-540-44969-8_3
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