Graph Drawing (eBook, PDF)

10th International Symposium, GD 2002, Irvine, CA, USA, August 26-28, 2002, Revised Papers
Redaktion: Kobourov, Stephen G.; Goodrich, Michael T.

• Format: PDF

Produktbeschreibung

This book constitutes the thoroughly refereed post-proceedings of the 10th International Symposium on Graph Drawing, GD 2002, held in Irvine, CA, USA, in August 2002.The 24 revised full papers, 9 short papers, and 7 software demonstrations presented together with a report on the GD 2002 graph drawing contest were carefully reviewed and selected from a total of 48 regular paper submissions. All current aspects of graph drawing are addressed.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Berlin Heidelberg
• Seitenzahl: 398
• Erscheinungstermin: 2. August 2003
• Englisch
• ISBN-13: 9783540361510
• Artikelnr.: 53084046

Autorenporträt

Stephen G. Kobourov, University of Arizona, Tucson, Arizona, USA / Michael T. Goodrich, University of California at Irvine, Irvine, California, USA

Inhaltsangabe

Papers.- Sketch-Driven Orthogonal Graph Drawing.- Maintaining the Mental Map for Circular Drawings.- Graphs, They Are Changing.- Drawing Graphs on Two and Three Lines.- Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs.- Drawing Outer-Planar Graphs in O(n log n )Area.- Computing Labeled Orthogonal Drawings.- Computing and Drawing Isomorphic Subgraphs.- A Group-Theoretic Method for Drawing Graphs Symmetrically.- A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem.- Geometric Systems of Disjoint Representatives.- An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization.- Simple and Efficient Bilayer Cross Counting.- Orthogonal 3D Shapes of Theta Graphs.- Separating Thickness from Geometric Thickness.- Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs.- Compact Encodings of Planar Orthogonal Drawings.- Fractional Lengths and Crossing Numbers.- Drawing Directed Graphs Using One-Dimensional Optimization.- Graph Drawing by High-Dimensional Embedding.- Advances in C-Planarity Testing of Clustered Graphs.- HGV: A Library for Hierarchies, Graphs, and Views.- Rectangular Drawings of Planar Graphs.- Extended Rectangular Drawings of Plane Graphs with Designated Corners.- RINGS: A Technique for Visualizing Large Hierarchies.- Applying Crossing Reduction Strategies to Layered Compound Graphs.- Crossing Reduction by Windows Optimization.- Geometric Graphs with No Self-intersecting Path of Length Three.- Two New Heuristics for Two-Sided Bipartite Graph Drawing.- Straight-Line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio.- Some Applications of Orderly Spanning Trees in Graph Drawing.- Improving Walker's Algorithm to Run in Linear Time.- Semi-dynamic Orthogonal Drawings ofPlanar Graphs.- Software Demonstrations.- Graph Layout for Workflow Applications with ILOG JViews.- InterViewer: Dynamic Visualization of Protein-Protein Interactions.- Some Modifications of Sugiyama Approach.- A Framework for Complexity Management in Graph Visualization.- A Partitioned Approach to Protein Interaction Mapping.- Camera Position Reconstruction and Tight Direction Networks.- Demonstration of a Preprocessor for the Spring Embedder.- Graph Drawing Contest.- Graph-Drawing Contest Report.- Invited Talks.- Techniques for Interactive Graph Drawing.- Drawing Venn Diagrams.