Graph-drawing contest report

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1353, Issue , 1997, Pages 438-445

  Eades, Peter ^a   Marks, Joe ^b   North, Stephen ^c  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b MITSUBISHI ELECTRIC RESEARCH LABORATORIES   (United States)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

GRAPH DRAWING; GRAPH-DRAWING TECHNOLOGY; STATE OF THE ART;

DRAWING (GRAPHICS);

EID: 21944450804     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63938-1_88     Document Type: Conference Paper

References (8)

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 DIMA CS 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 GD '95), pages 224-233, Berlin Heidelberg, September 1995. Springer-Verlag.
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.
5. U. Fößmeier and M. Katffmarm. 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 Heiddberg, 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. ToUis, editors, Lecture Notes in Computer Science: 894 (Proceedings of the DIMA CS International Workshop on Graph Drawing '9, pages 4) 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. Woolsey, 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.