Abstract
Large graphs such as WWW connection graphs or VLSI schematics cannot be drawn in a readable way by traditional graph drawing techniques. An approach to solve this problem is, for example, fish-eye representation, which allows one to display a small part of the graph enlarged while the graph is shown completely (see e.g. Formella and Keller (1995)). Another way is drawing only a part of the graph. The method presented here is clustering, that is grouping the vertex set.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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
Brockenauer, R., Cornelsen, S. (2001). Drawing Clusters and Hierarchies. 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_8
Download citation
DOI: https://doi.org/10.1007/3-540-44969-8_8
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