Graph Drawing Contest Report

  • Christian A. Duncan
  • Carsten Gutwenger
  • Lev Nachmanson
  • Georg Sander
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5849)


This report describes the 16th Annual Graph Drawing Contest, held in conjunction with the 2009 Graph Drawing Symposium in Chicago, USA. The purpose of the contest is to monitor and challenge the current state of graph-drawing technology.


Directed Edge Graph Draw Free Node Blue Node Layout Algorithm 
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.


  1. 1.
    AT&T. Graphviz,
  2. 2.
    Chimani, M., Gutwenger, C., Mutzel, P., Wong, H.: Upward planarization layout. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 94–106. Springer, Heidelberg (2010)Google Scholar
  3. 3.
    Eades, P., Lin, T., Lin, X.: Minimum size h-v drawings. In: Advanced Visual Interfaces (Proc. AVI 1992). World Series in Computer Science, vol. 36, pp. 386–394 (1992)Google Scholar
  4. 4.
    University of Karlsruhe. visone,
  5. 5.
    Reingold, E., Tilford, J.: Tidier drawing of trees. IEEE Trans. on Software Engineering 7(2), 223–228 (1981)CrossRefGoogle Scholar
  6. 6.
    Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical systems. IEEE Trans. Sys. Man, and Cyb. SMC11(2), 109–125 (1981)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Wikipedia. Sister cities, (accessed, May 2009)

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Christian A. Duncan
    • 1
  • Carsten Gutwenger
    • 2
  • Lev Nachmanson
    • 3
  • Georg Sander
    • 4
  1. 1.Louisiana Tech UniversityRustonUSA
  2. 2.University of DortmundGermany
  3. 3.MicrosoftUSA
  4. 4.IBMGermany

Personalised recommendations