Advertisement

Graph-drawing contest report

  • Peter Eades
  • Joe Marks
  • Stephen North
Graph-Drawing Contest
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1353)

Abstract

This report describes the Fourth Annual Graph Drawing Contest, held in conjunction with the 1997 Graph Drawing Symposium in Rome, Italy. The purpose of the contest is to monitor and challenge the current state of the art in graph-drawing technology [2, 3, 4].

Keywords

Graph Draw Interactive Exploration Hierarchical Cluster Technique Label Placement Electric Research Laboratory 
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

  1. 1.
    M. Anderberg. Cluster Analysis for Applications. Academic Press, New York, 1973.Google Scholar
  2. 2.
    P. Eades and J. Marks. Graph-drawing contest report. In R. Tamassia and I. G. Tollis, editors, Lecture Notes in Computer Science: 894 (Proceedings of the DIMACS International Workshop on Graph Drawing '94), pages 143–146, Berlin Heidelberg, October 1994. Springer-Verlag.Google Scholar
  3. 3.
    P. Eades and J. Marks. Graph-drawing contest report. In F. J. Brandenburg, editor, Lecture Notes in Computer Science. 1027 (Proceedings of the Symposium on Graph Drawing GD '95), pages 224–233, Berlin Heidelberg, September 1995. Springer-Verlag.Google Scholar
  4. 4.
    P. Eades, J. Marks, and S. North. Graph-drawing contest report.In S. North, editor, Lecture Notes in Computer Science: 1190 (Proceedings of the Symposium on Graph Drawing GD '96), pages 129–138, Berlin Heidelberg, September 1996. Springer-Verlag.Google Scholar
  5. 5.
    U. Fößmeler and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F. J. Brandenburg, editor, Lecture Notes in Computer Science. 1027 (Proceedings of the Symposium on Graph Drawing GD '95), pages 254–266, Berlin Heidelberg, September 1995. Springer-Verlag.Google Scholar
  6. 6.
    A. Frick, H. Mehldau, and A. Ludwig. A fast adaptive layout algorithm for undirected graphs. In R. Tamassia and I. G. Tollis, editors, Lecture Notes in Computer Science: 894 (Proceedings of the DIMACS International Workshop on Graph Drawing '94), pages 388–403, Berlin Heidelberg, October 1994. Springer-Verlag.Google Scholar
  7. 7.
    M. Jünger and P. Mutzel. Solving the maximum weight planar subgraph problem by branch and cut. In G. Rinaldi and L. Wolsey, editors, Proceedings of the Third Conference on Integer Programming and Combinatorial Optimization (IPCO), pages 479–492, 1993.Google Scholar
  8. 8.
    R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing, 16(3):421–444, 1987.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Peter Eades
    • 1
  • Joe Marks
    • 2
  • Stephen North
    • 3
  1. 1.Department of Computer ScienceUniversity of NewcastleCallaghanAustralia
  2. 2.MERL-A Mitsubishi Electric Research LaboratoryCambridgeUSA
  3. 3.AT&T ResearchFlorham ParkUSA

Personalised recommendations