Graph-Drawing Contest Report

Eades, Peter and Marks, Joe and North, Stephen (1998) Graph-Drawing Contest Report. In: Graph Drawing, September 18-20, 1997, Rome, Italy , pp. 438-445 .

Full text not available from this repository.

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].

Item Type:Conference Paper
Classifications:A General Literature > A.002 Conference Related
ID Code:88

Repository Staff Only: item control page

References

1. M. Anderberg. Cluster Analysis for Applications. Academic Press, New York, 1973.

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.

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 '95), pages 224-233, Berlin Heidelberg, September 1995. Springer-Verlag.

4. P. Eades and 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 '96), pages 129-138, Berlin Heidelberg, September 1996. Springer-Verlag.

5. U. Fößmeier and M. Kaufman. 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 '95), pages 254-266, Berlin Heidelberg, September 1995. Springer-Verlag.

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.

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.

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.