Graph Drawing: 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This volume constitutes the refereed proceedings of the 17th International Symposium on Graph Drawing, GD 2009, held in Chicago, USA, during September 2009. The 31 revised full papers and 4 short papers presented were carefully reviewed and selected out of 79 submissions. Furthermore, 10 posters were accepted in a separate submission process.

Author(s): János Pach (auth.), David Eppstein, Emden R. Gansner (eds.)
Series: Lecture Notes in Computer Science 5849
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010

Language: English
Commentary: Incorrect bookmarks ("Chapter XX"), no cover, no pagination
Pages: 426
Tags: Discrete Mathematics in Computer Science; Math Applications in Computer Science; Algorithm Analysis and Problem Complexity; Models and Principles; Symbolic and Algebraic Manipulation; User Interfaces and Human Computer Interaction

Front Matter....Pages -
Why Are String Graphs So Beautiful?....Pages 1-1
The Art of Cheating When Drawing a Graph....Pages 2-2
Drawing Hamiltonian Cycles with No Large Angles....Pages 3-14
Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings....Pages 15-20
On the Perspectives Opened by Right Angle Crossing Drawings....Pages 21-32
Drawing 3-Polytopes with Good Vertex Resolution....Pages 33-44
Planar Drawings of Higher-Genus Graphs....Pages 45-56
Splitting Clusters to Get C-Planarity....Pages 57-68
On the Characterization of Level Planar Trees by Minimal Patterns....Pages 69-80
Characterization of Unlabeled Radial Level Planar Graphs....Pages 81-93
Upward Planarization Layout....Pages 94-106
More Flexible Radial Layout....Pages 107-118
WiGis: A Framework for Scalable Web-Based Interactive Graph Visualizations....Pages 119-134
Port Constraints in Hierarchical Layout of Data Flow Diagrams....Pages 135-146
Fast Edge-Routing for Large Graphs....Pages 147-158
Leftist Canonical Ordering....Pages 159-170
Succinct Greedy Drawings Do Not Always Exist....Pages 171-182
Geometric Simultaneous Embeddings of a Graph and a Matching....Pages 183-194
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs....Pages 195-200
Removing Independently Even Crossings....Pages 201-206
Manhattan-Geodesic Embedding of Planar Graphs....Pages 207-218
Orthogonal Connector Routing....Pages 219-231
On Rectilinear Drawing of Graphs....Pages 232-243
Semi-bipartite Graph Visualization for Gene Ontology Networks....Pages 244-255
On Open Problems in Biological Network Visualization....Pages 256-267
A Novel Grid-Based Visualization Approach for Metabolic Networks with Advanced Focus&Context View....Pages 268-279
Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs....Pages 280-291
Drawing Trees in a Streaming Model....Pages 292-303
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree....Pages 304-315
Drawing Planar 3-Trees with Given Face-Areas....Pages 316-322
3D Visibility Representations by Regular Polygons....Pages 323-333
Complexity of Some Geometric and Topological Problems....Pages 334-344
On Planar Supports for Hypergraphs....Pages 345-356
DAGmaps and ε -Visibility Representations of DAGs....Pages 357-368
Drawing Directed Graphs Clockwise....Pages 369-380
An Improved Algorithm for the Metro-line Crossing Minimization Problem....Pages 381-392
Layout with Circular and Other Non-linear Constraints Using Procrustes Projection....Pages 393-404
GMap: Drawing Graphs as Maps....Pages 405-407
Using High Dimensions to Compare Drawings of Graphs....Pages 408-410
On ρ -Constrained Upward Topological Book Embeddings....Pages 411-412
4-Labelings and Grid Embeddings of Plane Quadrangulations....Pages 413-414
IBM ILOG Graph Layout for Eclipse....Pages 415-416
Layout Techniques Coupled with Web2.0-Based Business Process Modeling....Pages 417-418
Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles....Pages 419-420
Visualization of Complex BPEL Models....Pages 421-423
DAGmaps and Dominance Relationships....Pages 424-425
Scaffold Hunter – Interactive Exploration of Chemical Space....Pages 426-427
Graph Drawing Contest Report....Pages 428-433
Back Matter....Pages -