Abstract
This report describes the Eight Annual Graph Drawing Contest, held in conjunction with the Ninth Graph Drawing Symposium in Vienna, Austria. The purpose of the contest is to monitor and challenge the current state of the graph-drawing technology and to display artistic work related to graph drawing.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
F.J. Brandenburg, U. Brandes, M. Himsolt and M. Raitner, Graph-Drawing Contest Report, Proc. 8th International Symposium on Graph Drawing (GD’ 2000) vol. 1984 LNCS (2000) 410–418.
P. Eades, A. Symvonis, and S.H. Whitesides, Two algorithms for three-dimensional orthogonal graph drawing. Proc. 4th International Symposium on Graph Drawing (GD’ 96), vol. 1190 LNCS (1996) 139–154.
R. Sekular and R. Blake, Perception, McGraw Hill, 1994.
J. M. Kleinberg, Authoritative sources in a hyperlinked environment. J. Assoc. Comput. Mach., 46 (1999) 604–632.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Biedl, T., Brandenburg, F.J. (2002). Graph-Drawing Contest Report. In: Mutzel, P., Jünger, M., Leipert, S. (eds) Graph Drawing. GD 2001. Lecture Notes in Computer Science, vol 2265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45848-4_60
Download citation
DOI: https://doi.org/10.1007/3-540-45848-4_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43309-5
Online ISBN: 978-3-540-45848-7
eBook Packages: Springer Book Archive