Abstract
Graph B, the “Theory Graph”, of the 1999 Graph Drawing Contest is visually explored using available and some hand-written graph drawing software.
Die Arbeit wurde mit Unterstützung eines Stipendiums im Rahmen des Gemein- samen Hochschulsonderprogramms III von Bund und Ländern über den DAAD ermöglicht.
Chapter PDF
Similar content being viewed by others
References
Thomas M.J. Fruchterman and Edward M. Reingold. Graph-drawing by force-directed placement. Software — Practice and Experience, 21(11):1129–1164, 1991.
Kurt Mehlhorn and Stefan Näher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999. Project home page at http://www.mpi-sb.mpg.de/LEDA/.
Petra Mutzel, Carsten Gutwenger, Ralf Brockenauer, Sergej Fialko, Gunnar W. Klau, Michael Krüger, Thomas Ziegler, Stefan Näher, David Alberts, Dirk Ambras, Gunter Koch, Michael Jünger, Christoph Buchheim, and Sebastian Leipert. A library of algorithms for graph drawing. In Sue H. Whitesides, editor, Proceedings of the 6th International Symposium on Graph Drawing (GD’ 98), volume 1547 of Lecture Notes in Computer Science, pages 456–457. Springer, 1998. Project home page at http://www.mpi-sb.mpg.de/AGD/.
Kozo Sugiyama, Shojiro Tagawa, and Mitsuhiko Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics, 11(2):109–125, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brandes, U. (1999). Hunting Down Graph B. In: Kratochvíyl, J. (eds) Graph Drawing. GD 1999. Lecture Notes in Computer Science, vol 1731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46648-7_42
Download citation
DOI: https://doi.org/10.1007/3-540-46648-7_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66904-3
Online ISBN: 978-3-540-46648-2
eBook Packages: Springer Book Archive