Hunting Down Graph B

  • Ulrik Brandes
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1731)

Abstract

Graph B, the “Theory Graph”, of the 1999 Graph Drawing Contest is visually explored using available and some hand-written graph drawing software.

References

  1. 1.
    Thomas M.J. Fruchterman and Edward M. Reingold. Graph-drawing by force-directed placement. Software — Practice and Experience, 21(11):1129–1164, 1991.Google Scholar
  2. 2.
    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/.Google Scholar
  3. 3.
    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/.Google Scholar
  4. 4.
    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.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Ulrik Brandes
    • 1
  1. 1.Department of Computer ScienceBrown University ProvidenceRhode Island

Personalised recommendations