Lecture Notes in Computer Science Edited by G. Goos, J. Hartmanis and J. van Leeuwen 1190 Advisory Board: W. Brauer D. Gries J. Stoer
Stephen North (Ed.) Graph Drawing Symposium on Graph Drawing, GD '96 Berkeley, California, USA September 18-20, 1996 Proceedings ~ Springer
Series Editors Gerhard Goos, Karlsruhe University, Germany Juris Hartmanis, Cornell University, NY, USA Jan van Leeuwen, Utrecht University, The Netherlands Volume Editor Stephen North AT&T Research 600 Mountain Avenue, Murray Hill, NJ 07974, USA E-mail: north@ research.att.com Cataloging-in-Publication data applied for Die Deutsche Bibliothek - CIP-Einheitsaufnahme Graph drawing 9 proceedings / Symposium on Graph Drawing, GD '96, Berkeley, California, USA, September 18-20, 1996. Stephen North (ed.). - Berlin ; Heidelberg ; New York ; Barcelona ; Budapest ; Hong Kong ; London ; Milan ; Paris ; Santa Clara ; Singapore ; Tokyo 9 Springer, 1997 (Lecture notes in computer science ; Voi. 1190) ISBN 3-540-62495-3 NE: North, Stephen [Hrsg.]; Symposium on Graph Drawing <1996, Berkeley, Calif.>; GT CR Subject Classification (1991): G.2.2,F.2.2, D.2.2, 1.3.5, J.6 1991 Mathematical Subject Classification: 05CXX, 68R10, 90C35, 94C15 ISSN 0302-9743 ISBN 3-540-62495-3 Springer-Verlag Berlin Heidelberg New York This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer -Verlag. Violations are liable for prosecution under the German Copyright Law. 9 Springer-Verlag Berlin Heidelberg 1997 Printed in Germany Typesetting: Camera-ready by author SPIN 10549894 06/3142-5 4 3 2 1 0 Printed on acid-free paper
Preface Graph Drawing '96 was held at the Mathematical Sciences Research Institute at the University of California i:: Berkeley, USA, September 18-20. Graph drawing is the focus of considerable interest in the mathematics, computer science, and graphics communities. The problems investigated include properties of graph embeddings and drawings, algorithms, complexity, order theory, systems, and applications in diverse fields including information visualization, software engineering, circuit layout, network management, and user interfaces. The annual symposium is an important forum for presenting recent results and fostering new research collaborations. This year a strong technical program of 24 papers and 8 demos was selected from the 50 papers and 21 demos submitted. The quality of these presentations made the symposium a fine success. The invited talk, "Graph Drawing from a User's Perspective" given by Donald Knuth, was attended by an overflow audience. The main technical program that followed in the next two and a half days incorporated 30-1ninute presentations of papers and 15-minute system demonstrations. More than 90 registered participants attended from 13 countries. Session topics included planarity, upward and orthogonal drawing, heuristics, experimental results, and graph drawing systems. A report on the judging of the annual graph drawing competition was again a highlight of the meeting, and a written summary can be found in these proceedings. Thanks are in order tbr the generous financial support received from the NSF and corporate sponsors. Their donations made it possible for a number of students and other academic colleagues to attend and give presentations. We are also grateful to the director of MSRI, Bill Thurston, for hosting the symposimn and to MSRI's staff for their diligent efforts. The real credit, of course, is due to the presenters for their technical contributions. The members of the program committee, listed below, also played a key role. On a personal note, I warmly thank Emden Gansner for his collegial advice m:d friendship, and Kimberly Garrett for organizing the meeting arrangements at MSRI so capably. AT&T staff members Carolyn Heaps and Lillian Linnell came to the rescue in distributing the submissions on a tight schedule. The leadership of AT&T Laboratories also deserves recognition for its long-term support of this research area. Graph Drawin 9 symposia are now being planned through 1999. Because a number of of the submissions that could not be accepted this year appeared to be preliminary descriptions of very promising work, we look forward to reports on the outcome of these efforts at future meetings. Califon, New Jersey November 1996 Stephen North
Organizer Stephen C. North, AT&T Laboratories VII Program Committee Franz J. Brandenburg, University of Passau, Germany Giuseppe Di Battista, University of Rome III, Italy Emden Gansner, AT~T Laboratories, USA Tomihisa Kamada, ACCESS Co., Japan David Kirkpatrick, University of British Columbia, Canada Stephen North, AT&T Laboratories, USA J~nos Pach, CUNY and Courant Institutes, USA Pierre Rosenstiehl, EHESS, Paris, France Steering Committee Franz J. Brandenburg, University of Passau, Germany Giuseppe Di Battista, University of Rome III, Italy Peter Eades, University of Newcastle, Australia Takao Nishizeki, Tohoku University, Japan Stephen North, AT&T Laboratories, USA Pierre Rosenstiehl, EHESS, Paris, France Roberto Tamassia, Brown University, USA Ioannis G. Tollis, University of Texas at Dallas, USA Sponsors National Science Foundation (through MSRI) AT&T Laboratories Sun Microsystems Tom Sawyer Software Meeting Arrangements Kimberly Garrett, MSRI Demo Arrangements at MSRI Joe Christy Neal Cassidy Jim Hoffman Rachelle Smnmers Dave Wright Computers provided by Silicon Graphics and Tom Sawyer Software Graph Drawing Competition Organizers Joe Marks, Mitsubishi Electric Research Laboratories Peter Eades, University of Newcastle External Referees James Abello, AT&T Laboratories Edith Cohen, AT&T Laboratories
viii Walter Didimo, University of Rome III Peter Eades, University of Newcastle Qingwen Feng, University of Newcastle Sandra Follaro, University of Rome III Patrick Garvan, University of Newcastle Ervin GySri, Mathematical Institute, Hungarian Academy of Sciences Keisuke Hara, Access Co. Yusuke Higuchi, Showa University Michael Himsolt, University of Passau Michael Kauflnann, University of Tiibingen Antonio Leonforte, Integra Spa Joe Marks, Mitsubishi Electric Research Laboratories Katsuhiro Ota, Keio University Brian Regan, University of Newcastle Mauricio Resende, AT&T Laboratories Miklds Simonovits, Mathematical Institute, Hungarian Academy of Sciences Steve Skienna, SUNY Stony Brook Andrea,s Stiibinger, University of Passau G6za T6th, Courant Institute, NYU Francesco Vargiu, Aipa Richard Webber, University of Newcastle
Contents Bipartite Embeddings of Trees in the Plane... 1 M. Abellanas, J. Garc(a, G. Herndndez, M. Noy and P. Ramos Series-Parallel Planar Ordered Sets Have Pagenumber Two... 11 M. Alzohairi and L Rival On Rectangle Visibility Graphs... 25 P. Bose, A. Dean, J. Hutchinson and T. Shermer A Graph Drawing and Translation Service on the WWW... 45 S. Bridgeman, A. Garg and R. Tamassia Drawing 2-, 3- and 4-colorable Graphs in O(n 2) Volume... 53 T. Calamoneri and A. Sterbini Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings... 63 T. Chan, M. T. Goodrich, S. R. Kosaraju and R. Tamassia Drawing Directed Acyclic Graphs: An Experimental Study... 76 G. Di Battista, A. Gary, G. Liotta, A. Parise, R. Tamassia, E. Tassinari, F. Vargiu and L. Vismara Circular Layout in the Graph Layout Toolkit... 92 U. Do~rus~z, B. Madden and P. Madden Multilevel Visualization of Clustered Graphs... 101 P. Eades and Q. W. Feng Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs... 113 P. Eades, Q. W. Feng and X. Lin Graph-Drawing Contest Report... 129 P. Eades, J. Marks and S. North Two Algorithms for Three Dimensional Orthogonal Graph Drawing... 139 P. Eades, A. Symvonis and S. Whitesides 2-Visibility Drawings of Planar Graphs... 155 U. Fb~meier, G. Kant and M. Kaufmann
Upper Bounds on the Number of Hidden Nodes in Sugiyama's Algorithm... 169 A. Frick Integration of Declarative Approaches... 184 A. Frick, C. Keskin and V. Vogelmann GIOTTO3D: A System for Visualizing Hierarchical Structures in 3D... 193 A. Gary and R. Tamassia A New Minimum Cost Flow Algorithm with Applications to Graph Drawing... 201 A. Garg and R. Tamassia Constrained Graph Layout... 217 W. He and K. Marriott The Graphlet System... 233 M. Himsolt On the Edge Label Placement Problem... 241 K. G. Kakoulis and L G. Tollis Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane... 257 J. Kratoehvll Wiring Edge-Disjoint Layouts... 271 R. Kuchem a,~d D. Wagner Proximity Drawings of Outerplanar Graphs... 286 W. Lenhart and G, Liotta Automatic Visualization of Two-Dimensional Cellular Complexes... 303 L. A. P. Lozada, C. F. X. de Mendon~a, R. M. Rosi and J. Stolfi An Alternative Method to Crossing Minimization on Hierarchical Graphs... 318 P. Mutzel A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs... 334 S.-i. Nakano, M. S. Rahman and T. Nishizeki Graphs Drawn with Few Crossings Per Edge... 345 Y. Pach and G. Tdth
A Pairing Technique for Area-Efficient Orthogonal Drawings... 355 A. Papakostas and I. G. Tollis Experimental and Theoretical Results in Interactive Orthogonal Graph Drawing... 371 A. Papakostas, J. M. Six and I. G. Tollis An Interactive System for Drawing Graphs... 387 K. Ryall, ]. Marks and S. Shieber Automatic Graph Clustering... 395 R. Sablowski and A. Frick Qualitative Visualization of Processes: Attributed Graph Layout and Focusing Techniques... 401 K. Wittenburg and L. Weitzman Author Index... 409