GD 2003: Graph Drawing pp 504-508 | Cite as

Graph Drawing Contest Report

  • Franz J. Brandenburg
  • Ulrik Brandes
  • Peter Eades
  • Joe Marks
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2912)

Abstract

This report describes the Tenth Annual Graph Drawing Contest, held in conjunction with the 2003 Graph Drawing Symposium in Perugia, Italy. The purpose of the contest is to monitor and challenge the current state of the graph-drawing technology.

Keywords

Transcriptional Network Network Motif Subgraph Isomorphism Graph Draw Summary Graph 
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.
Download to read the full conference paper text

References

  1. 1.
    Shen-Orr, S.S., Milo, R., Mangan, S., Alon, U.: Network motifs in the transcriptional regulation network of escherichia coli. Nature Genetics 31, 64–68 (2002)CrossRefGoogle Scholar
  2. 2.
    Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: Simple building blocks of complex networks. Science 298, 824–827 (2002)CrossRefGoogle Scholar
  3. 3.
    Dickerson, M., Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent drawings, visualizing nonplanar diagrams in a planar way. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 1–12. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  4. 4.
    Ullmann, J.R.: An algorithm for subgraph isomorphism. J. Assoc. Comput. Mach. 23, 31–42 (1976)MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Franz J. Brandenburg
    • 1
  • Ulrik Brandes
    • 2
  • Peter Eades
    • 3
  • Joe Marks
    • 4
  1. 1.Universität PassauPassauGermany
  2. 2.Universität KonstanzKonstanzGermany
  3. 3.Basser Department of Computer ScienceUniversity of SydneySydneyAustralia
  4. 4.Mitsubishi Research Laboratories (MERL)CambridgeUSA

Personalised recommendations