Graph Drawing : 18th International Symposium, GD 2010, Konstanz, Germany, September 21-24, 2010. Revised Selected Papers

by Brandes, Ulrik; Cornelsen, Sabine

• ISBN13: 9783642184680
• ISBN10: 3642184685
• Format: Paperback
• Copyright: 2011-07-14
• Publisher: Springer-Verlag New York Inc

Summary

This volume constitutes the refereed proceedings of the 18thInternational Symposium on Graph Drawing, GD 2010, held in Konstanz,Germany, during September 2010.The 30 revised full papers presented together with 5 revised short and 8poster papers were carefully reviewed and selected from 77 submissions.The volume also contains a detailed report about the 17th Annual GraphDrawing Contest, held as a satellite event of GD 2010. Devoted both totheoretical advances as well as to implemented solutions, the papers areconcerned with the geometric representation of graphs and networks andare motivated by those applications where it is crucial to visualizestructural information as graphs.

Table of Contents

Paper
On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles	p. 1
Monotone Drawings of Graphs	p. 13
Upward Geometric Graph Embeddings into Point Sets	p. 25
On a Tree and a Path with No Geometric Simultaneous Embedding	p. 38
Difference Map Readability for Dynamic Graphs	p. 50
Maximizing the Total Resolution of Graphs	p. 62
Plane Drawings of Queue and Deque Graphs	p. 68
An Experimental Evaluation of Multilevel Layout Methods	p. 80
Orthogonal Graph Drawing with Flexibility Constraints	p. 92
Drawing Ordered (k - 1)-Ary Trees on k-Grids	p. 105
Optimizing Regular Edge Labelings	p. 117
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area	p. 129
Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints	p. 141
Drawing Graphs on a Smartphone	p. 153
Topology-Driven Force-Directed Algorithms	p. 165
On Graphs Supported by Line Sets	p. 177
Drawing Trees with Perfect Angular Resolution and Polynomial Area	p. 183
Lombardi Drawings of Graphs	p. 195
Optimal ISD Angular Resolution for Low-Degree Graphs	p. 208
Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs	p. 220
A Computational Approach to Conway's Thrackle Conjecture	p. 226
Optimal K-Level Planarization and Crossing Minimization	p. 238
On Touching Triangle Graphs	p. 250
Triangle Contact Representations and Duality	p. 262
On Maximum Differential Graph Coloring	p. 274
Dot Product Representations of Planar Graphs	p. 287
Drawing Planar Graphs of Bounded Degree with Few Slopes	p. 293
Complexity of Finding Non-planar Rectilinear Drawings of Graphs	p. 305
Point-Set Embeddings of Plane 3-Trees (Extended Abstract)	p. 317
Improving Layered Graph Layouts with Edge Bundling	p. 329
Confluent Drawing Algorithms Using Rectangular Dualization	p. 341
How to Draw a Tait-Colorable Graph	p. 353
Universal Pointsets for 2-Coloured Trees	p. 365
The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs	p. 371
Convex Polygon Intersection Graphs	p. 377
Posters
GraphML-Based Exploration and Evaluation of Efficient Parallelization Alternatives for Automation Firmware	p. 389
Automatic Generation of Route Sketches	p. 391
Visualizing Differences between Two Large Graphs	p. 393
Placing Edge Labels by Modifying an Orthogonal Graph Drawing	p. 395
Large Crossing Angles in Circular Layouts	p. 397
GVSR: An On-Line Guide for Choosing a Graph Visualization Software	p. 400
IBM ILOG Multi-platform Graph Layout Technology	p. 402
Comparative Visualization of User Flows in Voice Portals	p. 404
Graph Drawing Contest
Graph Drawing Contest Report	p. 406
Author Index	p. 413
Table of Contents provided by Ingram. All Rights Reserved.