Lecture Notes in Computer Science 6502

Transcription

1 Lecture Notes in Computer Science 6502 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Germany Madhu Sudan Microsoft Research, Cambridge, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbruecken, Germany

2 Ulrik Brandes Sabine Cornelsen (Eds.) Graph Drawing 18th International Symposium, GD 2010 Konstanz, Germany, September 21-24, 2010 Revised Selected Papers 13

3 Volume Editors Ulrik Brandes Department of Computer and Information Science Sabine Cornelsen Department of Computer and Information Science ISSN e-issn ISBN e-isbn DOI / Springer Heidelberg Dordrecht London New York Library of Congress Control Number: CR Subject Classification (1998): E.1, G.2.2, G.1.6, I.5.3, H.2.8 LNCS Sublibrary: SL 1 Theoretical Computer Science and General Issues Springer-Verlag Berlin Heidelberg 2011 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. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper Springer is part of Springer Science+Business Media (

4 Preface The 18th International Symposium on Graph Drawing (GD 2010) was held in Konstanz, Germany, September 21 24, 2010, and was attended by 108 participants from 20 countries. In response to the call for papers, the Program Commitee received 77 submissions. Each submission was reviewed by at least three Program Committee members. Following substantial discussions, the committee accepted 30 long papers, 5 short papers, as well as 8 posters. GD 2010 invited two keynote speakers. Carsten Thomassen from the Technical University of Denmark gave a talk on graph decomposition, and Peter Eades from the University of Sydney outlined the future of graph drawing. Both talks were recorded and can be accessed via the conference website, Keeping with tradition, the symposium was accompanied by the 17th Annual Graph Drawing Contest, including an onsite Graph Drawing Challenge for conference attendees. A detailed report about the event is contained in this volume. The conference was preceded by progd, a free training event with tutorials on data mining, biological networks, and social networks. progd was organized in cooperation with the Research Training Group Explorative Analysis and Visualization of Large Information Spaces and the Konstanz Research School on Chemical Biology. For the first time, child care services were offered during the conference, and we do hope that the four little ones whose parents requested it enjoyed GD 2010 as much as we did. Many people contributed to the success of the conference. First of all, the authors of the submitted contributions deserve special thanks, as well as the members of the Program Committee and all external referees for their careful work and extensive discussions. In addition to the members of the Organizing Committee, we would like to thank especially Christine Agorastos, Gabriela Kruse-Niermann, and our excellent crew of student helpers who took care of all things big and small that have to be considered during such a meeting. The conference received considerable support from the hosting organization, University of Konstanz, and Deutsche Forschungsgemeinschaft (DFG). Furthermore, we are grateful to the various sponsors listed herein. The 19th International Symposium on Graph Drawing (GD 2011) will be held September 21 23, 2011, in Eindhoven, The Netherlands, and hosted by Bettina Speckmann and Marc van Kreveld. October 2010 Ulrik Brandes Sabine Cornelsen

5 Organization Steering Committee Franz J. Brandenburg Ulrik Brandes Giuseppe Di Battista Peter Eades David Eppstein Hubert de Fraysseix Emden R. Gansner Marc van Kreveld Giuseppe Liotta Takao Nishizeki Pierre Rosenstiehl Bettina Speckmann Roberto Tamassia (Chair) Ioannis G. Tollis University of Passau, Germany University of Rome III, Italy University of Sydney, Australia University of California, Irvine, USA EHESS Paris, France AT&T Research Labs, USA Utrecht University, The Netherlands University of Perugia, Italy Tohoku University, Japan EHESS Paris, France TU Eindhoven, The Netherlands Brown University, USA ICS-FORTH and University of Crete, Greece Organizing Committee Melanie Badent Ulrik Brandes (Co-chair) Sabine Cornelsen (Co-chair) Martin Mader Barbara Pampel Contest Committee Christian A. Duncan Carsten Gutwenger Lev Nachmanson Georg Sander (Chair) Louisiana Tech, USA TU Dortmund, Germany Microsoft Research, USA IBM, Germany

6 VIII Organization Program Committee David Auber Christian Bachmaier Ulrik Brandes (Chair) Sabine Cornelsen Giuseppe Di Battista Emilio Di Giacomo David Eppstein Emden R. Gansner Michael T. Goodrich Patrick Healy Seok-Hee Hong Michael Kaufmann Stephen G. Kobourov Jan Kratochvíl Giuseppe Liotta Henk Meijer Petra Mutzel Patrice Ossona de Mendez Maurizio Patrignani Marcus Schaefer Bettina Speckmann Antonios Symvonis Stephen Wismath Xiao Zhou University of Bordeaux I, France University of Passau, Germany University of Rome III, Italy University of Perugia, Italy University of California, Irvine, USA AT&T Research Labs, USA University of California, Irvine, USA University of Limerick, Ireland University of Sydney, Australia University of Tübingen, Germany University of Arizona, USA University of Prague, Czech Republic University of Perugia, Italy Roosevelt Academy, The Netherlands TU Dortmund, Germany EHESS Paris, France University of Rome III, Italy DePaul University, Chicago, USA TU Eindhoven, The Netherlands NTU Athens, Greece University of Lethbridge, Canada Tohoku University, Japan External Reviewers Patrizio Angelini Christopher Auer Melanie Badent Michael Bekos Carla Binucci Romain Bourqui Wolfgang Brunner Markus Chimani Walter Didimo Stefan Felsner Fabrizio Frati Andreas Gleißner Luca Grilli Karsten Klein Nils Kriege Martin Mader Kazuyuki Miura Pietro Palladino Barbara Pampel Christian Pich Bruno Pinaud Salvatore Romeo Hoi-Ming Wong

7 Organization IX Sponsors Explorative Analysis and Visualization of Large Information Spaces Gold Sponsors Silver Sponsors Contributors

8 Table of Contents Papers On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles... 1 Eyal Ackerman, Radoslav Fulek, and Csaba D. Tóth Monotone Drawings of Graphs Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, and Maurizio Patrignani Upward Geometric Graph Embeddings into Point Sets Patrizio Angelini, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, and Antonios Symvonis On a Tree and a Path with No Geometric Simultaneous Embedding Patrizio Angelini, Markus Geyer, Michael Kaufmann, and Daniel Neuwirth Difference Map Readability for Dynamic Graphs Daniel Archambault, Helen C. Purchase, and Bruno Pinaud Maximizing the Total Resolution of Graphs Evmorfia N. Argyriou, Michael A. Bekos, and Antonios Symvonis Plane Drawings of Queue and Deque Graphs Christopher Auer, Christian Bachmaier, Franz Josef Brandenburg, Wolfgang Brunner, and Andreas Gleißner An Experimental Evaluation of Multilevel Layout Methods Gereon Bartel, Carsten Gutwenger, Karsten Klein, and Petra Mutzel Orthogonal Graph Drawing with Flexibility Constraints Thomas Bläsius, Marcus Krug, Ignaz Rutter, and Dorothea Wagner Drawing Ordered (k 1) Ary Trees on k Grids Wolfgang Brunner and Marco Matzeder Optimizing Regular Edge Labelings Kevin Buchin, Bettina Speckmann, and Sander Verdonschot Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area Erin W. Chambers, David Eppstein, Michael T. Goodrich, and Maarten Löffler

9 XII Table of Contents Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints Markus Chimani, Carsten Gutwenger, Petra Mutzel, Miro Spönemann, and Hoi-Ming Wong Drawing Graphs on a Smartphone Giordano Da Lozzo, Giuseppe Di Battista, and Francesco Ingrassia Topology-Driven Force-Directed Algorithms Walter Didimo, Giuseppe Liotta, and Salvatore A. Romeo On Graphs Supported by Line Sets Vida Dujmović, William Evans, Stephen Kobourov, Giuseppe Liotta, Christophe Weibel, and Stephen Wismath Drawing Trees with Perfect Angular Resolution and Polynomial Area Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, and Martin Nöllenburg Lombardi Drawings of Graphs Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, and Martin Nöllenburg Optimal 3D Angular Resolution for Low-Degree Graphs David Eppstein, Maarten Löffler, Elena Mumford, and Martin Nöllenburg Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs Fabrizio Frati A Computational Approach to Conway s Thrackle Conjecture Radoslav Fulek and János Pach Optimal k-level Planarization and Crossing Minimization Graeme Gange, Peter J. Stuckey, and Kim Marriott On Touching Triangle Graphs Emden R. Gansner, Yifan Hu, and Stephen G. Kobourov Triangle Contact Representations and Duality Daniel Gonçalves, Benjamin Lévêque, and Alexandre Pinlou On Maximum Differential Graph Coloring Yifan Hu, Stephen Kobourov, and Sankar Veeramoni Dot Product Representations of Planar Graphs Ross J. Kang and Tobias Müller

10 Table of Contents XIII Drawing Planar Graphs of Bounded Degree with Few Slopes Balázs Keszegh, János Pach, and Dömötör Pálvölgyi Complexity of Finding Non-planar Rectilinear Drawings of Graphs Ján Maňuch, Murray Patterson, Sheung-Hung Poon, and Chris Thachuk Point-Set Embeddings of Plane 3-Trees (Extended Abstract) Rahnuma Islam Nishat, Debajyoti Mondal, and Md. Saidur Rahman Improving Layered Graph Layouts with Edge Bundling Sergey Pupyrev, Lev Nachmanson, and Michael Kaufmann Confluent Drawing Algorithms Using Rectangular Dualization Gianluca Quercini and Massimo Ancona How to Draw a Tait-Colorable Graph David A. Richter Universal Pointsets for 2-Coloured Trees Mereke van Garderen, Giuseppe Liotta, and Henk Meijer The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs Marc van Kreveld Convex Polygon Intersection Graphs ErikJanvanLeeuwenandJanvanLeeuwen Posters GraphML-Based Exploration and Evaluation of Efficient Parallelization Alternatives for Automation Firmware Jürgen Bregenzer Automatic Generation of Route Sketches Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, and Ignaz Rutter Visualizing Differences between Two Large Graphs Markus Geyer, Michael Kaufmann, and Robert Krug Placing Edge Labels by Modifying an Orthogonal Graph Drawing Konstantinos G. Kakoulis and Ioannis G. Tollis Large Crossing Angles in Circular Layouts Quan Nguyen, Peter Eades, Seok-Hee Hong, and Weidong Huang GVSR: An On-Line Guide for Choosing a Graph Visualization Software BrunoPinaudandPascaleKuntz

11 XIV Table of Contents IBM ILOG Multi-platform Graph Layout Technology Georg Sander Comparative Visualization of User Flows in Voice Portals Björn Zimmer, Dennie Ackermann, Manfred Schröder, Andreas Kerren, and Volker Ahlers Graph Drawing Contest Graph Drawing Contest Report Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, and Georg Sander Author Index