Abstract
Many graph drawing (GD) scenarios are dynamic inasmuch as they involve a repeated redrawing of the graph after frequently occurring changes to the graph structure and/or some layout properties.
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
Branke, J. (2001). Dynamic Graph Drawing. 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_9
Download citation
DOI: https://doi.org/10.1007/3-540-44969-8_9
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